Sciweavers

202 search results - page 15 / 41
» Algorithmic Information Theory and Foundations of Probabilit...
Sort
View
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 21 days ago
Fast algorithms for finding randomized strategies in game trees
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...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
AIIA
2003
Springer
14 years 1 months ago
Improving the SLA Algorithm Using Association Rules
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...
Evelina Lamma, Fabrizio Riguzzi, Andrea Stambazzi,...
JCST
2010
189views more  JCST 2010»
13 years 3 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
AGI
2011
13 years 7 days ago
Three Hypotheses about the Geometry of Mind
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...
Ben Goertzel, Matthew Iklé
SIGIR
2011
ACM
12 years 11 months ago
The interactive PRP for diversifying document rankings
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...
Guido Zuccon, Leif Azzopardi, C. J. van Rijsbergen