Search Results - (( basic complex path algorithm ) OR ( java applications usage algorithm ))
Search alternatives:
- applications usage »
- java applications »
- usage algorithm »
- path algorithm »
- basic complex »
- complex path »
-
1
Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm
Published 2021“…This paper develops a path planning algorithm of hyper-redundant manipulators to achieve a cyclic property. …”
Get full text
Get full text
Get full text
Article -
2
Particle swarm optimization (PSO) for CNC route problem
Published 2002“…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
Get full text
Get full text
Undergraduates Project Papers -
3
Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm
Published 2023Article -
4
An Effective Fast Searching Algorithm for Internet Crawling Usage
Published 2016“…The search algorithm is a crucial part in any internet applications. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
IMPLEMENTATION OF BEHAVIOUR BASED NAVIGATION IN A PHYSICALLY CONFINED SITE
Published 2017“…Selected basic behaviour-based algorithms such as wallfollower, obstacle avoidance, escape route and target detection are to be combined and its efficiency is measured. …”
Get full text
Get full text
Final Year Project -
6
-
7
Mining Sequential Patterns using I-PrefixSpan
Published 2008Get full text
Get full text
Citation Index Journal -
8
Mining Sequential Patterns Using I-PrefixSpan
Published 2007“…The experimental result shows that using Java 2, this method improves the speed of PrefixSpan up to almost two orders of magnitude as well as the memory usage to more than one order of magnitude.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
9
Unconstraint assignment problem : a molecular computing approach
Published 2006“…On the other hand, for the computational phase, itis discovered that the complexity of the unconstraint assignment problem can be reduced to a path problem of a graph, and thepossibility to solve the unconstraint assignment problem by DNA computing approach is shown in detail.…”
Get full text
Get full text
Article -
10
Enhanced Mobility Solution In Mobile Ipv6 Network
Published 2008“…Enhanced Mobility Solution in Mobile IPv6 Network is extremely complex; the study addressed the multihoming issues of MIPV6 Networks on the basis of NEMO Basic Support, analyzes the benefits of multihoming and discusses implementation issues of all classes of multihoming possibilities. …”
Get full text
Get full text
Thesis
