596 search results - page 54 / 120 » Search Strategies for Hybrid Search Spaces |
PVLDB
2010
13 years 7 months ago
2010
Recent improvements in positioning technology make massive moving object data widely available. One important analysis is to find the moving objects that travel together. Existin...
AI
1998
Springer
14 years 1 months ago
1998
Springer
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...
EVOW
2001
Springer
14 years 1 months ago
2001
Springer
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hyb...
ICRA
2007
IEEE
14 years 3 months ago
2007
IEEE
— The rapidly increasing complexity of tasks robotic systems are expected to carry out underscores the need for the development of motion planners that can take into account disc...
SAC
2011
ACM
12 years 12 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...