Sciweavers

292 search results - page 23 / 59
» Dormant program nodes and the efficiency of genetic programm...
Sort
View
SOCO
2008
Springer
13 years 7 months ago
GP on SPMD parallel graphics hardware for mega Bioinformatics data mining
Abstract We demonstrate a SIMD C++ genetic programming system on a single 128 node parallel nVidia GeForce 8800 GTX GPU under RapidMind's GPGPU Linux software by predicting te...
William B. Langdon, Andrew P. Harrison
JPDC
2006
100views more  JPDC 2006»
13 years 7 months ago
Dyn-MPI: Supporting MPI on medium-scale, non-dedicated clusters
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participati...
D. Brent Weatherly, David K. Lowenthal, Mario Naka...
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 7 months ago
A Performance Study of GA and LSH in Multiprocessor Job Scheduling
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
S. R. Vijayalakshmi, G. Padmavathi
BIB
2008
141views more  BIB 2008»
13 years 7 months ago
Detecting short tandem repeats from genome data: opening the software black box
Short tandem repeats, specifically microsatellites, are widely used genetic markers, associated with human genetic diseases, and play an important role in various regulatory mecha...
Angelika Merkel, Neil Gemmell
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...