Sciweavers

2626 search results - page 71 / 526
» The complexity of stochastic sequences
Sort
View
INFORMS
1998
142views more  INFORMS 1998»
14 years 11 months ago
Distributed State Space Generation of Discrete-State Stochastic Models
High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generatio...
Gianfranco Ciardo, Joshua Gluckman, David M. Nicol
LICS
2009
IEEE
15 years 6 months ago
Qualitative Determinacy and Decidability of Stochastic Games with Signals
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...
Nathalie Bertrand, Blaise Genest, Hugo Gimbert
ATAL
2005
Springer
15 years 5 months ago
Rapid on-line temporal sequence prediction by an adaptive agent
Robust sequence prediction is an essential component of an intelligent agent acting in a dynamic world. We consider the case of near-future event prediction by an online learning ...
Steven Jensen, Daniel Boley, Maria L. Gini, Paul R...
ICML
2001
IEEE
16 years 20 days ago
Direct Policy Search using Paired Statistical Tests
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
Malcolm J. A. Strens, Andrew W. Moore
STOC
2007
ACM
132views Algorithms» more  STOC 2007»
16 years 5 days ago
On the convergence of Newton's method for monotone systems of polynomial equations
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
Stefan Kiefer, Michael Luttenberger, Javier Esparz...