Sciweavers

602 search results - page 26 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
APIN
1999
143views more  APIN 1999»
14 years 9 months ago
Solving Electrical Distribution Problems Using Hybrid Evolutionary Data Analysis Techniques
Real-world electrical engineering problems can take advantage of the last Data Analysis methodologies. In this paper we will show that Genetic Fuzzy Rule-Based Systems and Genetic ...
Oscar Cordón, Francisco Herrera, Luciano S&...
71
Voted
EUROGP
2008
Springer
128views Optimization» more  EUROGP 2008»
14 years 11 months ago
Hardware Accelerators for Cartesian Genetic Programming
A new class of FPGA-based accelerators is presented for Cartesian Genetic Programming (CGP). The accelerators contain a genetic engine which is reused in all applications. Candidat...
Zdenek Vasícek, Lukás Sekanina
PLDI
2004
ACM
15 years 3 months ago
Min-cut program decomposition for thread-level speculation
With billion-transistor chips on the horizon, single-chip multiprocessors (CMPs) are likely to become commodity components. Speculative CMPs use hardware to enforce dependence, al...
Troy A. Johnson, Rudolf Eigenmann, T. N. Vijaykuma...
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
15 years 4 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
15 years 3 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 artificial neural network approaches have ignored the...
Gul Muhammad Khan, Julian F. Miller, David M. Hall...