287 search results - page 15 / 58 » A Tree Search Algorithm for Solving the Container Loading Pr... |
203
Voted
CP
2009
Springer
16 years 2 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
109
Voted
AAAI
2010
15 years 3 months ago
2010
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
117
click to vote
PVM
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
109
Voted
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
In this paper, we consider the problem of stereo matching using loopy belief propagation. Unlike previous methods which focus on the original spatial resolution, we hierarchically...
103
click to vote
CG
2010
Springer
15 years 6 days ago
2010
Springer
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...