1950 search results - page 14 / 390 » Varieties of Increasing Trees |
153
click to vote
ESSLLI
1999
Springer
15 years 10 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
190
click to vote
WADS
2009
Springer
16 years 14 days ago
2009
Springer
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...
177
click to vote
AUTONOMICS
2008
ACM
15 years 7 months ago
2008
ACM
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produc...
172
click to vote
ISCC
2005
IEEE
15 years 11 months ago
2005
IEEE
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...
170
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...