Sciweavers

350 search results - page 17 / 70
» Branching Programs for Tree Evaluation
Sort
View
VEE
2006
ACM
150views Virtualization» more  VEE 2006»
14 years 1 months ago
Evaluating fragment construction policies for SDT systems
Software Dynamic Translation (SDT) systems have been used for program instrumentation, dynamic optimization, security policy enforcement, intrusion detection, and many other uses....
Jason Hiser, Daniel Williams, Adrian Filipi, Jack ...
BMCBI
2010
137views more  BMCBI 2010»
13 years 7 months ago
TreeGraph 2: Combining and visualizing evidence from different phylogenetic analyses
Background: Today it is common to apply multiple potentially conflicting data sources to a given phylogenetic problem. At the same time, several different inference techniques are...
Ben C. Stöver, Kai F. Müller
EVOW
2005
Springer
14 years 1 months ago
On the Application of Evolutionary Algorithms to the Consensus Tree Problem
Computing consensus trees amounts to finding a single tree that summarizes a collection of trees. Three evolutionary algorithms are defined for this problem, featuring characteri...
Carlos Cotta
JSA
2006
97views more  JSA 2006»
13 years 7 months ago
Dynamic feature selection for hardware prediction
It is often possible to greatly improve the performance of a hardware system via the use of predictive (speculative) techniques. For example, the performance of out-of-order micro...
Alan Fern, Robert Givan, Babak Falsafi, T. N. Vija...
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
14 years 2 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold