3136 search results - page 140 / 628 » Genetic programming theory |
213
click to vote
IWCLS
2007
Springer
15 years 10 months ago
2007
Springer
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
120
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
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...
142
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
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...
122
click to vote
IWINAC
2005
Springer
15 years 10 months ago
2005
Springer
Whereas the selection concept of Genetic Algorithms (GAs) and Genetic Programming (GP) is basically realized by the selection of above-average parents for reproduction, Evolution S...
174
click to vote
HASKELL
2009
ACM
15 years 11 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...