1277 search results - page 48 / 256 » Terminating Decision Algorithms Optimally |
140
click to vote
CIAC
2010
Springer
15 years 6 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
114
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
In typical multiagent teamwork settings, the teammates are either programmed together, or are otherwise provided with standard communication languages and coordination protocols. ...
131
click to vote
VLDB
1991
ACM
15 years 6 months ago
1991
ACM
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
141
click to vote
IJCAI
2007
15 years 4 months ago
2007
Dynamic programming algorithms provide a basic tool identifying optimal solutions in Markov Decision Processes (MDP). The paper develops a representation for decision diagrams sui...
133
click to vote
TELETRAFFIC
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we present a method for determining optimal routes along selected paths in a wireless mesh network based on an interference aware delay analysis. We develop an analyt...