520 search results - page 46 / 104 » New Complexity Results for Classical Planning Benchmarks |
ECOOP
2005
Springer
14 years 2 months ago
2005
Springer
There are many algorithms for concurrent garbage collection, but they are complex to describe, verify, and implement. This has resulted in a poor understanding of the relationships...
AI
2004
Springer
13 years 8 months ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
ATAL
2003
Springer
14 years 1 months ago
2003
Springer
Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degr...
OTM
2010
Springer
13 years 6 months ago
2010
Springer
The current trend of increasingly larger Web-based applications makes scalability the key challenge when developing, deploying, and maintaining data centers. At the same time, the ...