Sciweavers

785 search results - page 7 / 157
» Binary Join Trees
Sort
View
GECCO
2004
Springer
104views Optimization» more  GECCO 2004»
15 years 3 months ago
Optimization of Constructive Solid Geometry Via a Tree-Based Multi-objective Genetic Algorithm
This paper presents the multi-objective evolutionary optimization of three-dimensional geometry represented via constructive solid geometry (CSG), a binary tree of boolean operatio...
Karim Hamza, Kazuhiro Saitou
ICDCS
2003
IEEE
15 years 2 months ago
Neighbor Table Construction and Update in a Dynamic Peer-to-Peer Network
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
Huaiyu Liu, Simon S. Lam

Book
2145views
16 years 7 months ago
An Introduction to Binary Search Trees and Balanced Trees
"Libavl is a library in ANSI C for manipulation of various types of binary trees. This book provides an introduction to binary tree techniques and presents all of Libavl’s ...
Ben Pfaff
CPC
2008
135views more  CPC 2008»
14 years 9 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
Michael Fuchs
78
Voted
EJC
2008
14 years 9 months ago
On Postnikov's hook length formula for binary trees
We present a combinatorial proof of Postnikov's hook length formula for binary trees. c 2007 Elsevier Ltd. All rights reserved. Let [n] = {1, 2, . . . , n}. It is well known ...
William Y. C. Chen, Laura L. M. Yang