2412 search results - page 248 / 483 » Which Problems Have Strongly Exponential Complexity |
154
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
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...
145
click to vote
JACIII
2007
15 years 3 months ago
2007
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
128
Voted
IJAR
2010
15 years 1 months ago
2010
In this paper we present TANC, i.e., a tree-augmented naive credal classifier based on imprecise probabilities; it models prior near-ignorance via the Extreme Imprecise Dirichlet ...
131
Voted
CPAIOR
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Over the past years, a number of increasingly expressive languages for modelling constraint and optimisation problems have evolved. In developing a strategy to ease the c...
145
Voted
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
We propose a new approach called "appearance clustering" for scene analysis. The key idea in this approach is that the scene points can be clustered according to their s...