220 search results - page 36 / 44 » Learning probabilistic decision graphs |
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
FORMATS
2010
Springer
13 years 5 months ago
2010
Springer
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...
ICDAR
2007
IEEE
14 years 1 months ago
2007
IEEE
The Machine Learning and Pattern Recognition communities are facing two challenges: solving the normalization problem, and solving the deep learning problem. The normalization pro...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this paper, we propose a general cross-layer optimization framework in which we explicitly consider both the heterogeneous and dynamically changing characteristics of delay-sens...
KDD
2002
ACM
14 years 7 months ago
2002
ACM
Viral marketing takes advantage of networks of influence among customers to inexpensively achieve large changes in behavior. Our research seeks to put it on a firmer footing by mi...