Search Results - (( problem representation path algorithm ) OR ( java application mining algorithm ))

Mobile robot path planning using hybrid genetic algorithm and traversability vectors method by Loo, C.K., Rajeswari, M., Wong, E.K., RaoTask, M.V.C.

“…Recent advances in robotics and machine intelligence have led to the application of modern optimization method such as the genetic algorithm (GA), to solve the path-planning problem. …”
Get full text
Get full text
Get full text

Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

“…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the scanning tasks need to be segregated and assigned for each scanner head, and path planning where the best combinatorial paths for each scanner are determined in order to minimize the total motion of scanning time. …”
Get full text
Get full text

Path optimization using genetic algorithm in laser scanning system by Chen C.P., Koh S.P., Aris I.B., Albert F.Y.C., Tiong S.K.

Subjects:

Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

Get full text
Get full text

Path planning algorithm for a car like robot based on Coronoi Diagram Method by Inun, Haidie

“…The algorithm is based on Voronoi diagram method for the environment representation combined with Dijkstra’s algorithm to find the shortest path. …”
Get full text
Get full text
Get full text
Get full text

Whale Optimisation Freeman Chain Code (WO-FCC) extraction algorithm for handwritten character recognition by Muhammad Arif, Mohamad, Jamaludin, Sallim, Kohbalan, Moorthy

“…Freeman chaincode (FCC) is utilised as a data representations of handwritten text images. Nevertheless, the representations of FCC depends on the length of the path and the branching of the character’s nodes. …”
Get full text
Get full text
Get full text

Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

Get full text
Get full text

Path optimization using genetic algorithm in laser scanning system by Chen, Chai Phing, Koh, Johnny Siaw Paw, Aris, Ishak, Fong, Albert Yu Chooi, Tiong, Sieh Kiong

“…The GA would base on the real-number representation, namely Real-Coded Genetic Algorithm (RCGA). …”
Get full text
Get full text

Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

“…The integrated algorithms use two genetic representations for the individual solution entire sub-chromosomes. …”
Get full text
Get full text

Vehicle routing problem using genetic algorithm / Shamini Nagaratnam by Shamini , Nagaratnam

“…This dissertation studies and explores the potential of using Genetic Algorithms to find the shortest path in Vehicle Routing Problem. …”
Get full text
Get full text
Get full text

Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

“…Attached sensors generate data and send these data to the Java Servlet application through a WIFI module. These data are processed and stored in appropriate formats in a MySQL server database. …”
Get full text
Get full text
Get full text

Problem Solving by Yahaya, Azizi

“…There key steps of problem solving are problem identification, problem definition and representation, strategy construction, organization of information, allocation of resources, monitoring, and evaluation. …”
Get full text
Get full text

Algebraic Net Class Rewriting Systems, Syntax and Semantics for Knowledge Representation and Automated Problem Solving by Tirri, Seppo Ilari

Get full text
Get full text

Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

“…Sequential pattern mining is a relatively new data-mining problem with many areas of application. …”
Get full text
Get full text
Get full text

A web-based implementation of k-means algorithms by Lee, Quan

“…This stinginess of proximity measures in data mining tools is stifling the performance of the algorithm. …”
Get full text
Get full text

Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh, Johnny Siaw Paw, Aris, Ishak, Ramachandaramurthy, Vigna Kumaran, Bashi, Sinan Mahmod, Marhaban, Mohammad Hamiruce

“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Get full text
Get full text
Get full text

Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”

Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”

Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

“…Job Shop Scheduling Problem (JSSP) is one of the well-known hard combinatorial scheduling problems and one of the most computationally difficult combinatorial optimization problems considered to date. …”
Get full text
Get full text
Get full text

Mining Sequential Patterns using I-PrefixSpan by Saputra , Dhany, Dayang R.A. Rambli, Foong, Oi Mean

Get full text
Get full text