Sciweavers

350 search results - page 11 / 70
» Branching Programs for Tree Evaluation
Sort
View
TCBB
2010
106views more  TCBB 2010»
13 years 2 months ago
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...
Christophe Godin, Pascal Ferraro
GPEM
2002
145views more  GPEM 2002»
13 years 7 months ago
An Analysis of the Causes of Code Growth in Genetic Programming
Abstract. This research examines the cause of code growth (bloat) in genetic programming (GP). Currently there are three hypothesized causes of code growth in GP: protection, drift...
Terence Soule, Robert B. Heckendorn
INFORMS
2006
87views more  INFORMS 2006»
13 years 7 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...
GECCO
2003
Springer
121views Optimization» more  GECCO 2003»
14 years 21 days ago
Evolving Hogg's Quantum Algorithm Using Linear-Tree GP
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In thi...
André Leier, Wolfgang Banzhaf
ISCC
2002
IEEE
14 years 12 days ago
A new approach to construct multicast trees in MPLS networks
In this paper1 , we present a new approach to construct multicast trees in MPLS networks. This approach utilizes MPLS LSPs between multicast tree branching node routers in order to...
Ali Boudani, Bernard Cousin