Sciweavers

5995 search results - page 121 / 1199
» Algorithmic Game Theory
Sort
View
140
Voted
TSMC
2008
99views more  TSMC 2008»
15 years 3 months ago
A Context-Dependent Algorithm for Merging Uncertain Information in Possibility Theory
The need to merge multiple sources of uncertain information is an important issue in many application areas, especially when there is potential for contradictions between sources. ...
Anthony Hunter, Weiru Liu
125
Voted
CORR
2000
Springer
91views Education» more  CORR 2000»
15 years 3 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
133
Voted
ATAL
2009
Springer
15 years 10 months ago
Bounded rationality via recursion
Current trends in model construction in the field of agentbased computational economics base behavior of agents on either game theoretic procedures (e.g. belief learning, fictit...
Maciej Latek, Robert L. Axtell, Bogumil Kaminski
WEA
2010
Springer
476views Algorithms» more  WEA 2010»
15 years 10 months ago
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
Chris Whidden, Robert G. Beiko, Norbert Zeh
120
Voted
CORR
2011
Springer
170views Education» more  CORR 2011»
14 years 7 months ago
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluat...
Andreas Abel, Thierry Coquand, Miguel Pagano