202 search results - page 15 / 41 » Algorithmic Information Theory and Foundations of Probabilit... |
125
click to vote
STOC
1994
ACM
15 years 2 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
101
click to vote
AIIA
2003
Springer
15 years 3 months ago
2003
Springer
A bayesian network is an appropriate tool for working with uncertainty and probability, that are typical of real-life applications. In literature we find different approaches for b...
JCST
2010
14 years 5 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
110
click to vote
AGI
2011
14 years 2 months ago
2011
What set of concepts and formalizations might one use to make a practically useful, theoretically rigorous theory of generally intelligent systems? We present a novel perspective m...
110
click to vote
SIGIR
2011
ACM
14 years 1 months ago
2011
ACM
The assumptions underlying the Probability Ranking Principle (PRP) have led to a number of alternative approaches that cater or compensate for the PRP’s limitations. In this pos...