Sciweavers

1589 search results - page 151 / 318
» Multiple-Goal Heuristic Search
Sort
View
CG
2004
Springer
14 years 2 months ago
An Improved Safety Solver for Computer Go
Most Go-playing programs use a combination of search and heuristics based on an influence function to determine whether territories are safe. However, to assure the correct evaluat...
Xiaozhen Niu, Martin Müller 0003
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 10 months ago
The Exact Closest String Problem as a Constraint Satisfaction Problem
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
Tom Kelsey, Lars Kotthoff
ICGA
2007
89views Optimization» more  ICGA 2007»
13 years 10 months ago
Playing the Right Atari
We experimented a simple yet powerful optimization for Monte-Carlo Go tree search. It consists in dealing appropriately with strings that have two liberties. The heuristic is cont...
Tristan Cazenave
AI
2000
Springer
13 years 10 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
ML
2002
ACM
246views Machine Learning» more  ML 2002»
13 years 10 months ago
Bayesian Clustering by Dynamics
This paper introduces a Bayesian method for clustering dynamic processes. The method models dynamics as Markov chains and then applies an agglomerative clustering procedure to disc...
Marco Ramoni, Paola Sebastiani, Paul R. Cohen