On measures of search features

Tyck till om SwePub Sök här!

Jonsson, R. (författare): Mälardalens högskola,Akademin för innovation, design och teknik

(creator_code:org_t)

1999
1999
Engelska.
Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - 0302-9743. ; 1609, s. 657-664

Relaterad länk:: https://urn.kb.se/re...; visa fler...; https://doi.org/10.1...; visa färre...

Abstract Ämnesord

Stäng

- This paper describes several measures that can be useful when analyzing features of search in genetic algorithms. Results obtained by different researchers are often hard to compare and it is often difficult to draw general conclusions from them. This means that non-experienced users of genetic algorithms have little help in constructing their own effective solutions for a particular problem. The article contains a suggestion about possible ways of investigating features of search in genetic algorithms. These features are defined together with descriptions how to measure them. Â© Springer-Verlag Berlin Heidelberg 1999.

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.