Sciweavers

1884 search results - page 169 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
14 years 9 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas
134
Voted
CORR
2011
Springer
138views Education» more  CORR 2011»
14 years 9 months ago
A new approach to nonrepetitive sequences
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
129
Voted
CEC
2010
IEEE
15 years 2 months ago
Coevolutionary Temporal Difference Learning for small-board Go
—In this paper we apply Coevolutionary Temporal Difference Learning (CTDL), a hybrid of coevolutionary search and reinforcement learning proposed in our former study, to evolve s...
Krzysztof Krawiec, Marcin Szubert
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 6 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
140
Voted
RSA
2000
170views more  RSA 2000»
15 years 2 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski