4198 search results - page 163 / 840 » In search of lost time |
158
click to vote
AAAI
2008
15 years 8 months ago
2008
We present a breadth-first search algorithm, two-bit breadthfirst search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in se...
185
Voted
AIPS
2006
15 years 8 months ago
2006
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
205
click to vote
VMV
2001
15 years 8 months ago
2001
Usually, the stereo correspondence for a feature point in the first image is obtained by searching in a predefined region of the second image, based on the epipolar line and the m...
205
click to vote
AAAI
2000
15 years 8 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
164
click to vote
COLING
2000
15 years 8 months ago
2000
Backward beam search for dependency analysis of Japanese is proposed. As dependencies normally go from left to right in Japanese, it is effective to analyze sentences backwards (f...