Sciweavers

680 search results - page 94 / 136
» A randomized embedding algorithm for trees
Sort
View
WEBDB
2004
Springer
154views Database» more  WEBDB 2004»
14 years 2 months ago
Twig Query Processing over Graph-Structured XML Data
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
Zografoula Vagena, Mirella Moura Moro, Vassilis J....
BIBE
2003
IEEE
14 years 2 months ago
An Investigation of Phylogenetic Likelihood Methods
Abstract— We analyze the performance of likelihoodbased approaches used to reconstruct phylogenetic trees. Unlike other techniques such as Neighbor-Joining (NJ) and Maximum Parsi...
Tiffani L. Williams, Bernard M. E. Moret
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 20 days ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
IJCAI
2007
13 years 10 months ago
Automated Design of Multistage Mechanisms
Mechanism design is the study of preference aggregation protocols that work well in the face of self-interested agents. We present the first general-purpose techniques for automa...
Tuomas Sandholm, Vincent Conitzer, Craig Boutilier
FATES
2004
Springer
14 years 2 months ago
Online Testing of Real-time Systems Using Uppaal
We present the development of T-UPPAAL — a new tool for online black-box testing of real-time embedded systems from non-deterministic timed automata specifications. It is based ...
Kim Guldstrand Larsen, Marius Mikucionis, Brian Ni...