848 search results - page 121 / 170 » Randomness and the linear degrees of computability |
110
click to vote
DAGSTUHL
2007
15 years 1 months ago
2007
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor α that spre...
NIPS
2003
15 years 1 months ago
2003
Nonlinear filtering can solve very complex problems, but typically involve very time consuming calculations. Here we show that for filters that are constructed as a RBF network ...
JASSS
2002
14 years 11 months ago
2002
What is the degree of sophistication that we have to put into the agents in agents based computer simulation models? Should we provide them with a "mind"? The answer ran...
103
click to vote
JCISE
2002
14 years 11 months ago
2002
Online resources of engineering design information are a critical resource for practicing engineers. These online resources often contain references and content associated with te...
ML
2002
ACM
14 years 11 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...