Search Results - (( java application customization algorithm ) OR ( construct solution tree algorithm ))

A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree by Hasliza, A. Rahim@Samsuddin, Ab Rahman, A. A H, Andaljayalakshmi, G., R. Badlishah, Ahmad, Wan Nur Suryani Firuz, Wan Ariffin

Get full text

A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree by Rahim At Samsuddin, H. A., Ab. Rahman, A. A. H., Andaljayalakshmi, G., Ahmad, R. B.

“…This paper proposes an optimization approach for macro-cell placement which minimizes the chip area size. A binary tree method for non-slicing tree construction process is utilized for the placement and area optimization of macro-cell layout in very large scaled integrated (VLSI) design. …”
Get full text
Get full text

A genetic algorithm approach to VLSI macro cell non-slicing floorplans using binary tree by Hasliza, A. Rahim@Samsuddin, Ab Al-Hadi, Ab Rahman, Andaljayalakshmi, G., R. Badlishah, Ahmad, Wan Nur Suryani Firuz, Wan Arrifin

Get full text

Using unique-prime-factorization theorem to mine frequent patterns without generating tree by Tohidi, Hossein, Ibrahim, Hamidah

“…However, for a large database, constructing a large tree in the memory is a time consuming task and increase the time of execution. …”
Get full text
Get full text
Get full text

Parse tree visualization for Malay sentence (BMTutor) by Muhamad Noor, Yusnita, Jamaludin, Zulikha

“…It is also to enhance the learning process in BM that can be used by communities, especially students. An algorithm in designing BMTutor is discussed in this paper.The algorithm of the software is done sequentially as followed: 1) tokenizing 2) checking the number of words, 3) searching and comparing process to check the spelling or conjunctions, 4) assigning each word with a certain word class, 5) matching with rules, and 6) delivering/producing output (sentence correction or parse tree visualization, word attribute components, and parse tree from sentence examples).Based on the testing conducted, output from the development process shows that the prototype can correct all 15 invalid sentences and can produce parse tree visualization for all 20 sentences.…”
Get full text
Get full text
Get full text

Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem by Wong, Jerng Foong

“…The Greedy heuristics by ratio was employed to construct an initial solution. Next, the solution was enhanced by using the hybrid TS-SBA. …”
Get full text
Get full text
Get full text

Correlation analysis and predictive performance based on KNN and decision tree with augmented reality for nuclear primary cooling process / Ahmad Azhari Mohamad Nor by Mohamad Nor, Ahmad Azhari

“…Subsequently, predictive models employing k-nearest neighbour and decision tree algorithms are constructed and evaluated based on accuracy, precision, and recall metrics. …”
Get full text
Get full text

Theory-guided machine learning for predicting and minimising surface settlement caused by the excavation of twin tunnels / Chia Yu Huat by Chia , Yu Huat

“…In response to worsening urban traffic congestion, metro tunnels have emerged as a solution to ease pressure on road networks. Shield machines, like earth pressure balance and slurry machines, are pivotal in modern tunnel construction. …”
Get full text
Get full text
Get full text

A Robust Graph Theoretic Solution of Routing in Intelligent Networks by Qureshi, M.A., Hassan, M.F., Ehsan, M.K., Khan, M.O., Ali, M.Y., Khan, S.

“…That is why a simple and efficient algorithm is the need of the time. A robust routing solution SPT with OV+E time complexity is proposed to supersede the existing landmark. …”
Get full text
Get full text

Enhancing obfuscation technique for protecting source code against software reverse engineering by Mahfoudh, Asma

“…The proposed technique can be enhanced in the future to protect games applications and mobile applications that are developed by java; it can improve the software development industry. …”
Get full text
Get full text

Improving the efficiency of minimum determinant computation in space time trellis code with optimal subtree pruning by Ungku Azlin Ungku Chulan, Norbahiah Misran, Mohammad Tariqul Islam

“…In the heuristic optimization of code construction, the minimum determinant is derived via a variant of the branch and bound algorithm. …”
Get full text
Get full text
Get full text

DurianCare: optimising trunk disease detection and precision farming in a mobile application / Muhammad Haziq Azmi by Azmi, Muhammad Haziq

“…Durian tree trunk diseases are threatening to reduce the productivity of farmers and therefore have economic consequences, such as lower yield and increased cost. …”
Get full text
Get full text

Design & Development of a Robotic System Using LEGO Mindstorm by Abd Manap, Nurulfajar, Md Salim, Sani Irwan, Haron, Nor Zaidi

“…Since the model is built using LEGO bricks, the model is fully customized, in term of its applications, to perform any relevant tasks. …”
Get full text
Get full text
Get full text

An Accurate and Efficient Shooting-and-bouncing-polygon Ray Tracer For Radio Propagation Modelling by Teh, Chin Hui

“…Traversal of the CCP graph is also simpler than the binary tree. To improve CCP usability, we have developed and implemented a tool to automatically construct the CCP graph from a given set of 3D walls. …”
Get full text
Get full text

A semi-automated requirements prioritisation technique for scalable requirements with stakeholder quantification and prioritisation by Hujainah, Fadhl Mohammed Omar

“…The StakeQP is on the basis of the newly proposed new measurement criteria for each SQP attribute and using the multi-attribute decision-making method, namely, technique of order preference similarity to the ideal solution (TOPSIS). Furthermore, the proposed SRPTackle is based on the combination of the proposed StakeQP technique, the constructed requirement priority value formulation function and the employing of classifying algorithm (K-means and K-means++) and binary search tree. …”
Get full text
Get full text