{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/GA","name":"GA","description":"This package provides a framework for working with genetic\nalgorithms. A genetic algorithm is an evolutionary technique,\ninspired by biological evolution, to evolve entities that perform\nas good as possible in terms of a predefined criterion (the scoring\nfunction). Note: lower scores are assumed to indicate better entities.\nThe GA module provides a type class for defining entities and the\nfunctions that are required by the genetic algorithm.\nCheckpointing in between generations is available, as is automatic\nrestoring from the last available checkpoint.","version":"1.0","softwareVersion":"1.0","license":"https://spdx.org/licenses/BSD-3-Clause","url":"http://boegel.kejo.be","keywords":["ai","algorithms","bsd3","library","optimisation","Propose Tags"],"maintainer":[{"@type":"Person","name":"KennethHoste"}],"author":[{"@type":"Person","name":"KennethHoste"}],"copyrightHolder":[{"@type":"Person","name":"KennethHoste"}],"dateCreated":"2011-08-31","dateModified":"2011-09-27","datePublished":"2011-09-27","copyrightYear":2011,"downloadUrl":"https://hackage.haskell.org/package/GA-1.0/GA-1.0.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","sameAs":["https://hackage.haskell.org/package/GA"]}