2626 search results - page 10 / 526 » The complexity of stochastic sequences |
COLT
2004
Springer
15 years 5 months ago
2004
Springer
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
NIPS
2007
15 years 1 months ago
2007
It is known that determinining whether a DEC-POMDP, namely, a cooperative partially observable stochastic game (POSG), has a cooperative strategy with positive expected reward is ...
CP
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Cost-based filtering is a novel approach that combines techniques from Operations Research and Constraint Programming to filter from decision variable domains values that...
DEDS
2006
14 years 11 months ago
2006
In the last decade ordinal optimization (OO) has been successfully applied in many stochastic simulation-based optimization problems (SP) and deterministic complex problems (DCP). ...
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...