Swinburne
Browse

Optimizing and matching bitstrings

Download (65.88 kB)
report
posted on 2024-07-12, 16:36 authored by Jason Brownlee
Strings of bits (bitstrings) are a common first-order representation in the design and preliminary investigation of computational intelligence algorithms given (1) the ease in mapping the strings to arbitrary domains (such as real numbers), and (2) in terms of mathematical analysis. This work considers the use of bitstrings in the context of the clonal expansion and antigenic selection in a general clonal selection algorithm and provides a general review of mutation-based optimization (genetic algorithms) and bit-string matching (classifier systems and negative selection).

History

Parent title

Complex Intelligent Systems: technical reports

Publisher

Swinburne University of Technology

Copyright statement

Copyright © 2007 Jason Brownlee.

Language

eng

Usage metrics

    Publications

    Categories

    No categories selected

    Keywords

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC