Sciweavers

97 search results - page 5 / 20
» Local Strategy Improvement for Parity Game Solving
Sort
View
CIG
2005
IEEE
14 years 2 months ago
Case-Injection Improves Response Time for a Real-Time Strategy Game
We present a case-injected genetic algorithm player for Strike Ops, a real-time strategy game. Such strategy games are fundamentally resource allocation optimization problems and o...
Chris Miles, Sushil J. Louis
AAAI
1994
13 years 9 months ago
Noise Strategies for Improving Local Search
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
Bart Selman, Henry A. Kautz, Bram Cohen
ML
1998
ACM
220views Machine Learning» more  ML 1998»
13 years 8 months ago
Learning to Improve Coordinated Actions in Cooperative Distributed Problem-Solving Environments
Abstract. Coordination is an essential technique in cooperative, distributed multiagent systems. However, sophisticated coordination strategies are not always cost-effective in all...
Toshiharu Sugawara, Victor R. Lesser
LPAR
2004
Springer
14 years 1 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
CSCLP
2008
Springer
13 years 10 months ago
Solving CSPs with Naming Games
Abstract. Constraint solving problems (CSPs) represent a formalization of an important class of problems in computer science. We propose here a solving methodology based on the nam...
Stefano Bistarelli, Giorgio Gosti