Sciweavers

602 search results - page 93 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
OOPSLA
2010
Springer
13 years 9 months ago
Language virtualization for heterogeneous parallel computing
As heterogeneous parallel systems become dominant, application developers are being forced to turn to an incompatible mix of low level programming models (e.g. OpenMP, MPI, CUDA, ...
Hassan Chafi, Zach DeVito, Adriaan Moors, Tiark Ro...
EC
2008
146views ECommerce» more  EC 2008»
13 years 11 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
TEC
2002
119views more  TEC 2002»
13 years 10 months ago
Graph-based evolutionary design of arithmetic circuits
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
Dingjun Chen, Takafumi Aoki, Naofumi Homma, Toshik...
FLAIRS
2007
14 years 1 months ago
Performance Analysis of Evolutionary Search with a Dynamic Restart Policy
In this work we explore how the complexity of a problem domain affects the performance of evolutionary search using a performance-based restart policy. Previous research indicates...
Michael Solano, Istvan Jonyer
EUROGP
1999
Springer
166views Optimization» more  EUROGP 1999»
14 years 3 months ago
Adapting the Fitness Function in GP for Data Mining
In this paper we describe how the Stepwise Adaptation of Weights (saw) technique can be applied in genetic programming. The saw-ing mechanism has been originally developed for and ...
Jeroen Eggermont, A. E. Eiben, Jano I. van Hemert