Sciweavers

1092 search results - page 182 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
111
Voted
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
15 years 7 months ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
COCOON
2004
Springer
15 years 7 months ago
Transshipment Through Crossdocks with Inventory and Time Windows
Abstract. The supply chain between manufacturers and retailers always includes transshipments through a network of locations. A major challenge in making demand meet supply has bee...
Andrew Lim, Zhaowei Miao, Brian Rodrigues, Zhou Xu
139
Voted
LATIN
2004
Springer
15 years 7 months ago
A Proof System and a Decision Procedure for Equality Logic
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
Olga Tveretina, Hans Zantema
NMR
2004
Springer
15 years 7 months ago
Plan reversals for recovery in execution monitoring
In this paper, we introduce a new method to recover from discrepancies in a general monitoring framework where the agent finds some explanations (points of failure) for discrepan...
Thomas Eiter, Esra Erdem, Wolfgang Faber
ATAL
2003
Springer
15 years 7 months ago
Constructing optimal policies for agents with constrained architectures
Optimal behavior is a very desirable property of autonomous agents and, as such, has received much attention over the years. However, making optimal decisions and executing optima...
Dmitri A. Dolgov, Edmund H. Durfee