466 search results - page 3 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
ASPDAC
2004
ACM
13 years 10 months ago
2004
ACM
AAAI
1998
13 years 6 months ago
1998
Manyproblems,such as the sliding-tile puzzles, generate searchtrees wheredifferent nodeshavedifferent numbersof children, in this case dependingon the position of the blank. Wesho...
JSAT
2010
13 years 4 days ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
CCIA
2007
Springer
13 years 9 months ago
2007
Springer
In this paper we explain an estimation function for the crew scheduling problem in the coach transportation domain. Thanks to this function we obtain an estimation that is very clo...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...