Sciweavers

350 search results - page 46 / 70
» Branching Programs for Tree Evaluation
Sort
View
HPCA
2007
IEEE
14 years 8 months ago
Exploiting Postdominance for Speculative Parallelization
Task-selection policies are critical to the performance of any architecture that uses speculation to extract parallel tasks from a sequential thread. This paper demonstrates that ...
Mayank Agarwal, Kshitiz Malik, Kevin M. Woley, Sam...
JFP
2006
113views more  JFP 2006»
13 years 7 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
BMCBI
2005
97views more  BMCBI 2005»
13 years 7 months ago
Phylogenetic reconstruction of ancestral character states for gene expression and mRNA splicing data
Background: As genomes evolve after speciation, gene content, coding sequence, gene expression, and splicing all diverge with time from ancestors with close relatives. A minimum e...
Roald Rossnes, Ingvar Eidhammer, David A. Liberles
GECCO
2004
Springer
140views Optimization» more  GECCO 2004»
14 years 1 months ago
Keeping the Diversity with Small Populations Using Logic-Based Genetic Programming
We present a new method of Logic-Based Genetic Programming (LBGP). Using the intrinsic mechanism of backtracking in Prolog, we utilize large individual programs with redundant clau...
Ken Taniguchi, Takao Terano
ESOP
2004
Springer
14 years 1 months ago
Adaptive Pattern Matching on Binary Data
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This paper presents an approac...
Per Gustafsson, Konstantinos F. Sagonas