Sciweavers

3455 search results - page 67 / 691
» Generalized Game Trees
Sort
View
ESOP
2008
Springer
15 years 5 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
AI
2006
Springer
15 years 4 months ago
Is real-valued minimax pathological?
Deeper searches in game-playing programs relying on the minimax principle generally produce better results. Theoretical analyses, however, suggest that in many cases minimaxing am...
Mitja Lustrek, Matjaz Gams, Ivan Bratko
LICS
2007
IEEE
15 years 10 months ago
A Contraction Method to Decide MSO Theories of Deterministic Trees
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
Angelo Montanari, Gabriele Puppis
ICMCS
2000
IEEE
86views Multimedia» more  ICMCS 2000»
15 years 8 months ago
Visual Segment Tree Creation for MPEG-7 Description Schemes
This paper deals with the creation of visual segment trees involved in MPEG-7 Description Schemes. After a brief overview of MPEG7 description schemes in general and of the Segmen...
Philippe Salembier, Joan Llach, Luis Garrido
EUROGP
2010
Springer
330views Optimization» more  EUROGP 2010»
15 years 10 months ago
Bandit-Based Genetic Programming
We consider the validation of randomly generated patterns in a Monte-Carlo Tree Search program. Our bandit-based genetic programming (BGP) algorithm, with proved mathematical prope...
Jean-Baptiste Hoock, Olivier Teytaud