Sciweavers

350 search results - page 9 / 70
» On Strategy Improvement Algorithms for Simple Stochastic Gam...
Sort
View
LICS
2009
IEEE
15 years 4 months ago
Qualitative Determinacy and Decidability of Stochastic Games with Signals
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...
Nathalie Bertrand, Blaise Genest, Hugo Gimbert
EVOW
2010
Springer
15 years 4 months ago
Evolving Behaviour Trees for the Commercial Game DEFCON
Abstract. Behaviour trees provide the possibility of improving on existing Artificial Intelligence techniques in games by being simple to implement, scalable, able to handle the c...
Chong-U Lim, Robin Baumgarten, Simon Colton
ACL
2011
14 years 1 months ago
Learning to Win by Reading Manuals in a Monte-Carlo Framework
This paper presents a novel approach for leveraging automatically extracted textual knowledge to improve the performance of control applications such as games. Our ultimate goal i...
S. R. K. Branavan, David Silver, Regina Barzilay
CSB
2005
IEEE
115views Bioinformatics» more  CSB 2005»
15 years 3 months ago
A New Clustering Strategy with Stochastic Merging and Removing Based on Kernel Functions
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
Huimin Geng, Hesham H. Ali
ICALP
2003
Springer
15 years 2 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper