287 search results - page 5 / 58 » A Tree Search Algorithm for Solving the Container Loading Pr... |
DATESO
2007
13 years 9 months ago
2007
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
SSS
2009
Springer
14 years 2 months ago
2009
Springer
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...
IJCAI
2003
13 years 8 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
NETWORKS
2007
13 years 7 months ago
2007
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
IJCAI
2003
13 years 8 months ago
2003
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...