Sciweavers

350 search results - page 15 / 70
» Branching Programs for Tree Evaluation
Sort
View
CGO
2006
IEEE
13 years 11 months ago
2D-Profiling: Detecting Input-Dependent Branches with a Single Input Data Set
Static compilers use profiling to predict run-time program behavior. Generally, this requires multiple input sets to capture wide variations in run-time behavior. This is expensiv...
Hyesoon Kim, M. Aater Suleman, Onur Mutlu, Yale N....
ASPLOS
1996
ACM
13 years 11 months ago
Analysis of Branch Prediction Via Data Compression
Branch prediction is an important mechanism in modern microprocessor design. The focus of research in this area has been on designing new branch prediction schemes. In contrast, v...
I-Cheng K. Chen, John T. Coffey, Trevor N. Mudge
RT
2001
Springer
13 years 12 months ago
Interactive Rendering of Trees with Shading and Shadows
The goal of this paper is the interactive rendering of 3D trees covering a landscape, with shading and shadows consistent with the lighting conditions. We propose a new IBR represe...
Alexandre Meyer, Fabrice Neyret, Pierre Poulin
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
14 years 1 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
EVOW
2010
Springer
14 years 2 months ago
Top-Down Induction of Phylogenetic Trees
We propose a novel distance based method for phylogenetic tree reconstruction. Our method is based on a conceptual clustering method that extends the well-known decision tree learn...
Celine Vens, Eduardo Costa, Hendrik Blockeel