2412 search results - page 144 / 483 » Which Problems Have Strongly Exponential Complexity |
124
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
112
click to vote
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
— The last decade, sampling based planners like the Probabilistic Roadmap Method have proved to be successful in solving complex motion planning problems. We give a reachability ...
135
click to vote
CP
2007
Springer
15 years 9 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
117
click to vote
COCO
2007
Springer
15 years 9 months ago
2007
Springer
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
267
click to vote
ICDE
2007
IEEE
16 years 4 months ago
2007
IEEE
We study the problem of answering queries posed on virtual views of XML documents, a problem commonly encountered when enforcing XML access control and integrating data. We approa...