Sciweavers

376 search results - page 4 / 76
» Evaluating Heuristic Optimization Phase Order Search Algorit...
Sort
View
AIPS
2009
15 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
ICCBR
2007
Springer
15 years 12 months ago
Using Cases Utility for Heuristic Planning Improvement
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...
Tomás de la Rosa, Angel García Olaya...
EOR
2008
91views more  EOR 2008»
15 years 5 months ago
A branch-and-bound algorithm for the linear ordering problem with cumulative costs
The Linear Ordering Problem with Cumulative Costs is an NP-hard combinatorial optimization problem arising from an application in UMTS mobile-phone communication systems. This pap...
Giovanni Righini
AIPS
2000
15 years 7 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
CP
2000
Springer
15 years 10 months ago
New Search Heuristics for Max-CSP
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
Kalev Kask