69 search results - page 5 / 14 » Generic Incremental Algorithms for Local Search |
115
click to vote
CORR
2007
Springer
14 years 11 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...
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
107
click to vote
AI
2010
Springer
14 years 11 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
110
click to vote
CEC
2010
IEEE
15 years 21 days ago
2010
IEEE
A key feature in population based optimization algorithms is the ability to explore a search space and make a decision based on multiple solutions. In this paper, an incremental le...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
We show how to extend the ICP framework to nonrigid registration, while retaining the convergence properties of the original algorithm. The resulting optimal step nonrigid ICP fra...