Sciweavers

3455 search results - page 104 / 691
» Generalized Game Trees
Sort
View
CEC
2011
IEEE
14 years 4 months ago
Ms Pac-Man versus Ghost Team CEC 2011 competition
—Games provide an ideal test bed for computational intelligence and significant progress has been made in recent years, most notably in games such as GO, where the level of play...
Philipp Rohlfshagen, Simon M. Lucas
CSR
2007
Springer
15 years 10 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
FOSSACS
2009
Springer
15 years 11 months ago
Parameter Reduction in Grammar-Compressed Trees
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-S...
SWAT
2004
Springer
129views Algorithms» more  SWAT 2004»
15 years 9 months ago
Collective Tree Spanners of Graphs
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
Feodor F. Dragan, Chenyu Yan, Irina Lomonosov
DCC
1998
IEEE
15 years 8 months ago
The Context Trees of Block Sorting Compression
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
N. Jesper Larsson