Sciweavers

602 search results - page 52 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
64
Voted
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 3 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
BMCBI
2007
171views more  BMCBI 2007»
14 years 9 months ago
Classification of microarray data using gene networks
Background: Microarrays have become extremely useful for analysing genetic phenomena, but establishing a relation between microarray analysis results (typically a list of genes) a...
Franck Rapaport, Andrei Zinovyev, Marie Dutreix, E...
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
15 years 1 months ago
Convergence to global optima for genetic programming systems with dynamically scaled operators
This work shows asymptotic convergence to global optima for a family of dynamically scaled genetic programming systems where the underlying population consists of a fixed number o...
Lothar M. Schmitt, Stefan Droste
DPD
2002
163views more  DPD 2002»
14 years 9 months ago
Evolutionary Techniques for Web Caching
Web caching has been proposed as an effective solution to the problems of network traffic and congestion, Web objects access and Web load balancing. This paper presents a model for...
Athena Vakali
CCO
2001
Springer
168views Combinatorics» more  CCO 2001»
15 years 2 months ago
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
Yves Pochet