1 - 5 of 5 articles
This paper finds sufficient conditions for fully or partially deceptive binary functions by calculating schema average fitness values. Deception conditions are first derived for functions of unitation (functions that depend only on the number of 1s in the string) and then extended for any binary...
A key result sufficient for the asymptotic stability of the mixing operator in infinite population genetic algorithms depended upon a conjecture. While empirical results supported the conjecture, no proof has been heretofore obtained. In this paper we supply a proof of the conjecture. In so...
This paper examines the influence of mutation on the behavior of genetic algorithms through a series of examples and experiments. The results provide an existence proof that mutation is a far more profound operator than has ever been recognized. Implications are discussed which point to the...
A rigorous formulation of the generalisation of schema analysis known as forma analysis is presented. This is shown to provide a direct mechanism for harnessing knowledge about a search space, codified through the imposition of equivalence relations over that space, to generate a genetic...
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.