Sciweavers

4095 search results - page 99 / 819
» How to test a tree
Sort
View
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
14 years 4 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
ICDT
2003
ACM
126views Database» more  ICDT 2003»
14 years 3 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven
WOB
2004
134views Bioinformatics» more  WOB 2004»
13 years 11 months ago
Reconstruction of Phylogenetic Trees using the Ant Colony Optimization Paradigm
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
Heitor S. Lopes, Mauricio Perretto
CPE
1997
Springer
79views Hardware» more  CPE 1997»
14 years 2 months ago
Storage Alternatives for Large Structured State Spaces
We consider the problem of storing and searching a large state space obtained from a high-level model such as a queueing network or a Petri net. After reviewing the traditional te...
Gianfranco Ciardo, Andrew S. Miner
ACG
2009
Springer
14 years 2 months ago
A Study of UCT and Its Enhancements in an Artificial Game
Abstract. Monte-Carlo tree search, especially the UCT algorithm and its enhancements, have become extremely popular. Because of the importance of this family of algorithms, a deepe...
David Tom, Martin Müller