Sciweavers

1599 search results - page 307 / 320
» Algorithms for Parity Games
Sort
View
ICML
2008
IEEE
15 years 10 months ago
Sample-based learning and search with permanent and transient memories
We present a reinforcement learning architecture, Dyna-2, that encompasses both samplebased learning and sample-based search, and that generalises across states during both learni...
David Silver, Martin Müller 0003, Richard S. ...
SIGMOD
2007
ACM
178views Database» more  SIGMOD 2007»
15 years 9 months ago
Quality is in the eye of the beholder: towards user-centric web-databases
The proliferation of database-driven web sites (or web-databases) has brought upon a plethora of applications where both Quality of Service (QoS) and Quality of Data (QoD) are of ...
Huiming Qu, Jie Xu, Alexandros Labrinidis
MOBIHOC
2007
ACM
15 years 9 months ago
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
Dong Zheng, Weiyan Ge, Junshan Zhang
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
15 years 7 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
TACAS
2010
Springer
145views Algorithms» more  TACAS 2010»
15 years 4 months ago
Rational Synthesis
Abstract. Synthesis is the automated construction of a system from its specification. The system has to satisfy its specification in all possible environments. Modern systems oft...
Dana Fisman, Orna Kupferman, Yoad Lustig