1614 search results - page 59 / 323 » Breadth-First Heuristic Search |
EOR
2010
13 years 7 months ago
2010
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
CP
2007
Springer
14 years 4 months ago
2007
Springer
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
AIPS
2009
13 years 11 months ago
2009
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of t...
HEURISTICS
2000
13 years 10 months ago
2000
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertice...
JAIR
2006
13 years 10 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...