3223 search results - page 262 / 645 » The Scaling of Search Cost |
188
click to vote
AAAI
1996
15 years 8 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
183
click to vote
JAIR
2008
15 years 6 months ago
2008
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon intracta...
163
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
252
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
229
click to vote
CVPR
2011
IEEE
15 years 1 months ago
2011
IEEE
This paper presents a novel intrinsic 3D surface distance and its use in a complete probabilistic tracking framework for dynamic 3D data. Registering two frames of a deforming 3D ...