Sciweavers

1157 search results - page 59 / 232
» Solving iterated functions using genetic programming
Sort
View
159
Voted
CORR
2006
Springer
153views Education» more  CORR 2006»
15 years 3 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
131
Voted
ANTSW
2008
Springer
15 years 5 months ago
Two-Level ACO for Haplotype Inference Under Pure Parsimony
Abstract. Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genoty...
Stefano Benedettini, Andrea Roli, Luca Di Gaspero
123
Voted
CISS
2008
IEEE
15 years 10 months ago
A genetic algorithm for designing constellations with low error floors
—The error floor of bit-interleaved coded modulation with iterative decoding (BICM-ID) can be minimized for a particular constellation by maximizing the harmonic mean of the squ...
Matthew C. Valenti, Raghu Doppalapudi, Don J. Torr...
139
Voted
DPD
2002
163views more  DPD 2002»
15 years 3 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
127
Voted
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
15 years 9 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm