508 search results - page 63 / 102 » Learning for stochastic dynamic programming |
130
click to vote
CIG
2005
IEEE
15 years 7 months ago
2005
IEEE
A newly designed game is introduced, which feels like Backgammon, but has a simplified rule set. Unlike earlier attempts at simplifying the game, Nannon maintains enough features a...
128
click to vote
ICML
2000
IEEE
15 years 6 months ago
2000
IEEE
The reinforcement learning problem can be decomposed into two parallel types of inference: (i) estimating the parameters of a model for the underlying process; (ii) determining be...
149
click to vote
WSC
2007
15 years 4 months ago
2007
Adaptive Time Warp protocols in the literature are usually based on a pre-defined analytic model of the system, expressed as a closed form function that maps system state to cont...
118
click to vote
EHCI
2004
15 years 3 months ago
2004
Most of the current WWW is made up of dynamic pages. The development of dynamic pages is a difficult and costly endeavour, out-of-reach for most users, experts, and content produce...
117
click to vote
ACMACE
2006
ACM
15 years 8 months ago
2006
ACM
Massively multiplayer online computer games are played in complex, persistent virtual worlds. Over time, the landscape of these worlds evolves and changes as players create and pe...