Sciweavers

1798 search results - page 130 / 360
» A Tree for All Seasons
Sort
View
ICDCS
2009
IEEE
14 years 6 months ago
A Commutative Replicated Data Type for Cooperative Editing
A Commutative Replicated Data Type (CRDT) is one where all concurrent operations commute. The replicas of a CRDT converge automatically, without complex concurrency control. This ...
Nuno M. Preguiça, Joan Manuel Marquè...
COCOON
2007
Springer
14 years 3 months ago
Finding Equilibria in Games of No Chance
Abstract. We consider finding maximin strategies and equilibria of explicitly given extensive form games with imperfect information but with no moves of chance. We show that a max...
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, T...
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
14 years 3 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
GD
2004
Springer
14 years 2 months ago
Really Straight Graph Drawings
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, a...
Vida Dujmovic, Matthew Suderman, David R. Wood
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
14 years 1 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...