Search Results - (( java application mining algorithm ) OR ( _ modification path algorithm ))

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

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

Modification of dijkstra's algorithm for safest and shortest path during emergency evacuation by Khyrina Airin Fariza, Abu Samah, Burairah, Hussin, Abd Samad, Hasan Basari

“…Therefore, this paper presents the methodology used for the modification of Dijkstra's algorithm to find the safest and shortest path. …”
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

Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

“…This project includes the modification of main algorithm which has been implemented in the prototype development. …”
Get full text
Get full text
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

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

“…The simulation results indicate that the algorithm is able to segregate and assign the tasks for each scanning head and also able to find the shortest scanning path for different types of objects coordination. …”
Get full text
Get full text

A review on path planning and obstacle avoidance algorithms for autonomous mobile robots by Anis Naema Atiyah, Rafai, Noraziah, Adzhar, Nor Izzati, Jaini

“…This paper reviews the mobile robot navigation approaches and obstacle avoidance used so far in various environmental conditions to recognize the improvement of path planning strategists. Taking into consideration commonly used classical approaches such as Dijkstra algorithm (DA), artificial potential field (APF), probabilistic road map (PRM), cell decomposition (CD), and meta-heuristic techniques such as fuzzy logic (FL), neutral network (NN), particle swarm optimization (PSO), genetic algorithm (GA), cuckoo search algorithm (CSO), and artificial bee colony (ABC). …”
Get full text
Get full text
Get full text
Get full text

Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

“…In order to utilize the high performance hardware priority queue module, modifications have to be made on the graph-based shortest path algorithm. …”
Get full text
Get full text
Get full text

Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm by Ahmad, Javed, Ab Wahab, Mohd Nadhir, Ramli, Ahmad, Misro, Md Yushalify, Ezza, Wan Zafira, Wan Hasan, Wan Zuha

“…Experiments were carried out in four different layouts related to path-planning environments, and comparisons were made with various existing path-planning algorithms. …”
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

Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

“…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
Get full text
Get full text
Get full text

Research on risk detection of autonomous vehicle based on rapidly-exploring random tree by Yincong Ma, Lim, Kit Guan, Tan, Min Keng, Sin, Helen Ee Chuo, Ali Farzamnia, Tze, Kenneth Kin Teo

“…A non-particle collision detection (NPCD) collision detection algorithm and path modification (PM) path modification strategy are proposed for the collision risk in the turning process, and geometric constraints are used to represent the possible security threats, so as to improve the efficiency and safety of vehicle global path driving and to provide reference for the research of driverless vehicles.…”
Get full text
Get full text
Get full text
Get full text

Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm by Abu Samah, Khyrina Airin Fariza

“…Through ST adaptation, all subsystems were integrated and using the “Dijkstra’s algorithm” (DA) by modifying its function from shortest path algorithm to safest and shortest algorithm, to the nearest exit. …”
Get full text
Get full text
Get full text
Get full text

Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

“…This study also introduces a new probe-based procedure for discovery and setup QoS path for real-time traffic. The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) 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. …”

Development of obstacle avoidance technique in web-based geographic information system for traffic management using open source software by Nik Yusoff, Nik Mohd Ramli, Mohd Shafri, Helmi Zulhaidi, Muniandy, Ratnasamy, Mohammad Wali, Islam

“…Pg Routing as an extension of Postgre SQL/Post GIS database is an open source library that implements the Dijkstra shortest path algorithm. However, the functionality to avoid obstacles in that analysis is still limited. …”
Get full text
Get full text
Get full text