Sciweavers

2343 search results - page 185 / 469
» Visual-Concept Search Solved
Sort
View
ICMLA
2004
15 years 6 months ago
A new discrete binary particle swarm optimization based on learning automata
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
Reza Rastegar, Mohammad Reza Meybodi, Kambiz Badie
IJIT
2004
15 years 6 months ago
Memetic Algorithm Based Path Planning for a Mobile Robot
In this paper, the problem of finding the optimal collision free path for a mobile robot, the path planning problem, is solved using an advanced evolutionary algorithm called memet...
Neda Shahidi, Hadi Esmaeilzadeh, Marziye Abdollahi...
143
Voted
AAAI
1997
15 years 6 months ago
Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
Aaron A. Armstrong, Edmund H. Durfee
127
Voted
AAAI
1997
15 years 6 months ago
Ordered Semantic Hyper Linking
In this paper, we present a novel first order theorem proving strategy - ordered semantic hyper linking. Ordered semantic hyper linking (OSHL) is an instance-based refutational th...
David A. Plaisted, Yunshan Zhu
144
Voted
PUK
2000
15 years 6 months ago
4SP: A four stage incremental planning approach
GraphPlan-like and SATPLAN-like planners have shown to outperform classical planners for most of the classical planning domains. However, these two propositional approaches do not ...
Eva Onaindia, Laura Sebastia, Eliseo Marzal