Sciweavers

627 search results - page 59 / 126
» How optimal is the genetic code
Sort
View
110
Voted
GECCO
2004
Springer
15 years 9 months ago
Metaheuristics for Natural Language Tagging
Abstract. This work compares different metaheuristics techniques applied to an important problem in natural language: tagging. Tagging amounts to assigning to each word in a text ...
Lourdes Araujo, Gabriel Luque, Enrique Alba
133
Voted
GECCO
2004
Springer
114views Optimization» more  GECCO 2004»
15 years 9 months ago
Evolutionary Drug Scheduling Model for Cancer Chemotherapy
This paper presents a modified optimal control model of drug scheduling in cancer chemotherapy and a new adaptive elitist-population based genetic algorithm (AEGA) to solve it. Wo...
Yong Liang, Kwong-Sak Leung, Tony Shu Kam Mok
114
Voted
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 7 months ago
Algebraic simplification of GP programs during evolution
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
Phillip Wong, Mengjie Zhang
149
Voted
CONEXT
2007
ACM
15 years 7 months ago
Near-optimal co-ordinated coding in wireless multihop networks
The recent work on COPE by Katti et al. demonstrates a practical application of network coding to wireless multihop networks. We note, however, that the opportunistic nature of CO...
Björn Scheuermann, Wenjun Hu, Jon Crowcroft
121
Voted
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 9 months ago
A statistical learning theory approach of bloat
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in the framework of sy...
Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, ...