Sciweavers

1615 search results - page 195 / 323
» Pathology in heuristic search
Sort
View
HEURISTICS
2010
15 years 1 months ago
An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which bel...
Rafael Elizondo, Víctor Parada, Lorena Prad...
ICTAI
2002
IEEE
15 years 11 months ago
DSatz: A Directional SAT Solver for Planning
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C, Nov. 2002, p...
Mark Iwen, Amol Dattatraya Mali
SAC
2010
ACM
16 years 1 months ago
MSP algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
David Portugal, Rui Rocha
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
16 years 1 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
16 years 27 days ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...