Sciweavers

3455 search results - page 113 / 691
» Generalized Game Trees
Sort
View
137
Voted
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 8 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
LICS
2007
IEEE
15 years 10 months ago
Higher-Order Matching, Games and Automata
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
Colin Stirling
INFOCOM
2006
IEEE
15 years 10 months ago
Repeated-Game Modeling of Multicast Overlays
— This paper studies multicast application overlay networks in a repeated-game framework. In these overlays, users have both the motivation and the means to alter their position...
Mike Afergan, Rahul Sami
CORR
2007
Springer
106views Education» more  CORR 2007»
15 years 4 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos
127
Voted
IJCSS
2000
79views more  IJCSS 2000»
15 years 4 months ago
Impact of learning set quality and size on decision tree performances
Abstract. The quality of a decision tree is usually evaluated through its complexity and its generalization accuracy. Tree-simpli
Marc Sebban, Richard Nock, Jean-Hugues Chauchat, R...