Sciweavers

350 search results - page 35 / 70
» Branching Programs for Tree Evaluation
Sort
View
PPPJ
2009
ACM
14 years 2 months ago
Phase detection using trace compilation
Dynamic compilers can optimize application code speciļ¬cally for observed code behavior. Such behavior does not have to be stable across the entire program execution to be beneļ¬...
Christian Wimmer, Marcelo Silva Cintra, Michael Be...
ASPLOS
2012
ACM
12 years 3 months ago
Scalable address spaces using RCU balanced trees
Software developers commonly exploit multicore processors by building multithreaded software in which all threads of an application share a single address space. This shared addre...
Austin T. Clements, M. Frans Kaashoek, Nickolai Ze...
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
13 years 11 months ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
14 years 1 months ago
A developmental model of neural computation using cartesian genetic programming
The brain has long been seen as a powerful analogy from which novel computational techniques could be devised. However, most artiļ¬cial neural network approaches have ignored the...
Gul Muhammad Khan, Julian F. Miller, David M. Hall...
EUROPAR
2009
Springer
14 years 2 months ago
Steady-State for Batches of Identical Task Trees
Abstract In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on stead...
Sékou Diakité, Loris Marchal, Jean-M...