74 search results - page 6 / 15 » Boolean Games Revisited |
43
Voted
CORR
2007
Springer
15 years 12 days ago
2007
Springer
Machines for Dialogue Games P.-L. Curien (CNRS - Paris 7) H. Herbelin (INRIA-Futurs) July 16, 2005 The notion of abstract B¨ohm tree has arisen as an operationally-oriented disti...
116
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
97
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
AIIDE
2006
15 years 1 months ago
2006
To save precious time and space, many games and simulations use static terrain and fixed (or random) reconstruction of areas that a player leaves and later revisits. This can resu...
101
click to vote
FSTTCS
2004
Springer
15 years 5 months ago
2004
Springer
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We stu...