Sciweavers

1639 search results - page 155 / 328
» Anytime Heuristic Search
Sort
View
GECCO
2008
Springer
180views Optimization» more  GECCO 2008»
13 years 11 months ago
An agent-based collaborative evolutionary model for multimodal optimization
A novel approach to multimodal optimization called Roaming Agent-Based Collaborative Evolutionary Model (RACE) combining several evolutionary techniques with agent-based modeling ...
Rodica Ioana Lung, Camelia Chira, Dumitru Dumitres...
RP
2009
Springer
121views Control Systems» more  RP 2009»
14 years 4 months ago
Games with Opacity Condition
We describe the class of games with opacity condition, as an adequate model for security aspects of computing systems. We study their theoretical properties, relate them to reachab...
Bastien Maubert, Sophie Pinchinat
CG
2004
Springer
14 years 1 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