2412 search results - page 188 / 483 » Which Problems Have Strongly Exponential Complexity |
145
Voted
NIPS
2008
15 years 5 months ago
2008
Language comprehension in humans is significantly constrained by memory, yet rapid, highly incremental, and capable of utilizing a wide range of contextual information to resolve ...
117
Voted
SODA
2007
ACM
15 years 5 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
139
Voted
KER
2007
15 years 3 months ago
2007
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
129
Voted
COSIT
1995
Springer
15 years 7 months ago
1995
Springer
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
139
Voted
SAT
2005
Springer
15 years 9 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...