Extending selection learning toward fixed-length d-ary strings

DOI10.1007/3-540-46033-0_5MaRDI QIDQ4736891zbMATH OpenFDO

Authors Arnaud Berny

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2310/23100054.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Mutation-selection algorithm: A large deviation approach
• Statistical machine learning and combinatorial optimization
• Mathematical analysis of evolutionary algorithms
• Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
• Evolutionary algorithms: From recombination to search distributions

Cited in

(2)

• scientific article; zbMATH DE number 6999908 (Why is no real title available?)
• Negative selection algorithms on strings with efficient training and linear-time classification

This page was built for publication: Extending selection learning toward fixed-length \(d\)-ary strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736891)