Sciweavers

3694 search results - page 65 / 739
» Stochastic complexity in learning
Sort
View
DAGSTUHL
2007
13 years 9 months ago
Classical Simulation Complexity of Quantum Branching Programs
We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function w...
Farid M. Ablayev
IM
2007
13 years 7 months ago
Pursuit-Evasion in Models of Complex Networks
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
Anthony Bonato, Pawel Pralat, Changping Wang
PKDD
2009
Springer
102views Data Mining» more  PKDD 2009»
14 years 2 months ago
Relevance Grounding for Planning in Relational Domains
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
Tobias Lang, Marc Toussaint
COLT
2004
Springer
14 years 1 months ago
Convergence of Discrete MDL for Sequential Prediction
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....
Jan Poland, Marcus Hutter
WSC
1998
13 years 9 months ago
Integrating Neural Networks with Special Purpose Simulation
Traditional methods of dealing with variability in simulation input data are mainly stochastic. This is most often the best method to use if the factors affecting the variation or...
Dany Hajjar, Simaan M. AbouRizk, Kevin Mather