Sciweavers

178 search results - page 27 / 36
» Splitting a CR-Prolog Program
Sort
View
ICALP
2009
Springer
14 years 8 months ago
Smoothed Analysis of Balancing Networks
Abstract In a load balancing network each processor has an initial collection of unit-size jobs, tokens, and in each round, pairs of processors connected by balancers split their l...
Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
14 years 8 months ago
Relational joins on graphics processors
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs). The most recent GPU features include support for wr...
Bingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga K. ...
ICCAD
2007
IEEE
87views Hardware» more  ICCAD 2007»
14 years 4 months ago
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
—Register allocation, in high-level synthesis and ASIP design, is the process of determining the number of registers to include in the resulting circuit or processor. The goal is...
Philip Brisk, Ajay K. Verma, Paolo Ienne
CGO
2010
IEEE
14 years 2 months ago
Decoupled software pipelining creates parallelization opportunities
Decoupled Software Pipelining (DSWP) is one approach to automatically extract threads from loops. It partitions loops into long-running threads that communicate in a pipelined man...
Jialu Huang, Arun Raman, Thomas B. Jablin, Yun Zha...
CEC
2008
IEEE
14 years 2 months ago
Increasing rule extraction accuracy by post-processing GP trees
—Genetic programming (GP), is a very general and efficient technique, often capable of outperforming more specialized techniques on a variety of tasks. In this paper, we suggest ...
Ulf Johansson, Rikard König, Tuve Löfstr...