Sciweavers

401 search results - page 52 / 81
» Genetic Programming Theory and Practice
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
13 years 8 months ago
An analysis of multi-sampled issue and no-replacement tournament selection
Standard tournament selection samples individuals with replacement. The sampling-with-replacement strategy has its advantages but also has issues. One of the commonly recognised i...
Huayang Xie, Mengjie Zhang, Peter Andreae, Mark Jo...
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
13 years 8 months ago
Exploiting the path of least resistance in evolution
Hereditary Repulsion (HR) is a selection method coupled with a fitness constraint that substantially improves the performance and consistency of evolutionary algorithms. This als...
Gearoid Murphy, Conor Ryan
PLDI
2004
ACM
14 years 1 months ago
Region inference for an object-oriented language
Region-based memory management offers several important potential advantages over garbage collection, including real-time performance, better data locality, and more efficient us...
Wei-Ngan Chin, Florin Craciun, Shengchao Qin, Mart...
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen