4403 search results - page 21 / 881 » Galois Theory of Algorithms |
129
click to vote
TSMC
2008
15 years 1 months ago
2008
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. ...
110
Voted
CORR
2000
Springer
15 years 1 months ago
2000
Springer
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...
143
click to vote
SAGA
2007
Springer
15 years 8 months ago
2007
Springer
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
140
click to vote
WEA
2010
Springer
15 years 8 months ago
2010
Springer
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...
100
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
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...