Sciweavers

1075 search results - page 166 / 215
» Parallel Programming with Transactional Memory
Sort
View
SC
2004
ACM
14 years 3 months ago
The Potential of Computation Regrouping for Improving Locality
Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are ...
Chen Ding, Maksim Orlovich
GECCO
2006
Springer
180views Optimization» more  GECCO 2006»
14 years 1 months ago
Improving cooperative GP ensemble with clustering and pruning for pattern classification
A boosting algorithm based on cellular genetic programming to build an ensemble of predictors is proposed. The method evolves a population of trees for a fixed number of rounds an...
Gianluigi Folino, Clara Pizzuti, Giandomenico Spez...
PPOPP
2010
ACM
14 years 7 months ago
Fast tridiagonal solvers on the GPU
We study the performance of three parallel algorithms and their hybrid variants for solving tridiagonal linear systems on a GPU: cyclic reduction (CR), parallel cyclic reduction (...
Yao Zhang, Jonathan Cohen, John D. Owens
ICPP
1999
IEEE
14 years 2 months ago
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
CPHYSICS
2006
119views more  CPHYSICS 2006»
13 years 9 months ago
GDF: A tool for function estimation through grammatical evolution
This article introduces a tool for data fitting that is based on genetic programming and especially on the grammatical evolution technique. The user needs to input a series of poi...
Ioannis G. Tsoulos, Dimitris Gavrilis, Evangelos D...