313 search results - page 5 / 63 » Complete Local Search with Memory |
IROS
2008
IEEE
14 years 4 months ago
2008
IEEE
— This article addresses the problem of autonomous map building and exploration of an unknown environment with mobile robots. The proposed method assumes that mobile robots use o...
AAAI
2004
13 years 11 months ago
2004
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations,...
IAT
2007
IEEE
14 years 4 months ago
2007
IEEE
We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decis...
CP
2005
Springer
14 years 3 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
AAAI
2008
14 years 3 days ago
2008
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...