Sciweavers

281 search results - page 17 / 57
» Code Compaction Using Genetic Algorithms
Sort
View
GECCO
2003
Springer
14 years 3 months ago
Pruning Neural Networks with Distribution Estimation Algorithms
Abstract. This paper describes the application of four evolutionary algorithms to the pruning of neural networks used in classification problems. Besides of a simple genetic algor...
Erick Cantú-Paz
INFOCOM
1999
IEEE
14 years 2 months ago
Cache-Based Compaction: A New Technique for Optimizing Web Transfer
In this paper, we propose and study a new technique, which we call cache-based compaction for reducing the latency of Web browsing over a slow link. Our compaction technique trades...
Mun Choon Chan, Thomas Y. C. Woo
CEC
2005
IEEE
14 years 3 months ago
Linear genetic programming using a compressed genotype representation
This paper presents a modularization strategy for linear genetic programming (GP) based on a substring compression/substitution scheme. The purpose of this substitution scheme is t...
Johan Parent, Ann Nowé, Kris Steenhaut, Ann...
SIGADA
2004
Springer
14 years 3 months ago
Comparative analysis of genetic algorithm implementations
Genetic Algorithms provide computational procedures that are modeled on natural genetic system mechanics, whereby a coded solution is “evolved” from a set of potential solutio...
Robert Soricone, Melvin Neville
GECCO
2003
Springer
111views Optimization» more  GECCO 2003»
14 years 3 months ago
An Adaptive Penalty Scheme for Steady-State Genetic Algorithms
A parameter-less adaptive penalty scheme for steady-state genetic algorithms applied to constrained optimization problems is proposed. For each constraint, a penalty parameter is a...
Helio J. C. Barbosa, Afonso C. C. Lemonge