2957 search results - page 164 / 592 » The Complexity of Polynomial-Time Approximation |
165
click to vote
SIGGRAPH
1991
ACM
15 years 9 months ago
1991
ACM
Algorithms and computational complexity measures for simulating the motion of contacting bodies with friction are presented. The bodies are restricted to be perfectly rigid bodies...
155
click to vote
AIPS
2010
15 years 8 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
137
click to vote
AAAI
2008
15 years 8 months ago
2008
In this paper, we present a normal form for concept expressions in the description logic ALC which is based on a recently introduced notion of prime implicate for the modal logic ...
163
click to vote
AIPS
2007
15 years 8 months ago
2007
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
145
click to vote
COCOA
2008
Springer
15 years 7 months ago
2008
Springer
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...