1461 search results - page 119 / 293 » The Cost of Cache-Oblivious Searching |
195
click to vote
AIPS
2006
15 years 7 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
184
click to vote
AAAI
1996
15 years 7 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...
168
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
180
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...
156
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...