Sciweavers

1639 search results - page 1 / 328
» Anytime Heuristic Search
Sort
View
AIPS
2009
13 years 6 months ago
Suboptimal and Anytime Heuristic Search on Multi-Core Machines
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
Ethan Burns, Seth Lemons, Wheeler Ruml, Rong Zhou
IJCAI
2007
13 years 6 months ago
AWA* - A Window Constrained Anytime Heuristic Search Algorithm
Sandip Aine, P. P. Chakrabarti, Rajeev Kumar
JAIR
2007
82views more  JAIR 2007»
13 years 5 months ago
Anytime Heuristic Search
Eric A. Hansen, Rong Zhou
EC
2007
167views ECommerce» more  EC 2007»
13 years 5 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
AIPS
2010
13 years 7 months ago
The Joy of Forgetting: Faster Anytime Search via Restarting
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml