Sciweavers

520 search results - page 54 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
14 years 2 months ago
Learning, anticipation and time-deception in evolutionary online dynamic optimization
In this paper we focus on an important source of problem– difficulty in (online) dynamic optimization problems that has so far received significantly less attention than the tr...
Peter A. N. Bosman
FORMATS
2010
Springer
13 years 6 months ago
Combining Symbolic Representations for Solving Timed Games
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
Rüdiger Ehlers, Robert Mattmüller, Hans-...
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
14 years 7 days ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 8 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
ATAL
2008
Springer
13 years 10 months ago
Extending agent languages for autonomy
BDI agent languages provide a useful abstraction for complex systems comprised of interactive autonomous entities, but they have been used mostly in the context of single agents w...
Felipe Rech Meneguzzi