Bio inspired computing–a review of algorithms and scope of applications

AK Kar - Expert Systems with Applications, 2016 - Elsevier
With the explosion of data generation, getting optimal solutions to data driven problems is
increasingly becoming a challenge, if not impossible. It is increasingly being recognised that …

A comparative review of approaches to prevent premature convergence in GA

HM Pandey, A Chaudhary, D Mehrotra - Applied Soft Computing, 2014 - Elsevier
This paper surveys strategies applied to avoid premature convergence in Genetic
Algorithms (GAs). Genetic Algorithm belongs to the set of nature inspired algorithms. The …

Abandoning objectives: Evolution through the search for novelty alone

J Lehman, KO Stanley - Evolutionary computation, 2011 - ieeexplore.ieee.org
In evolutionary computation, the fitness function normally measures progress toward an
objective in the search space, effectively acting as an objective function. Through deception …

[图书][B] An introduction to genetic algorithms

M Mitchell - 1998 - books.google.com
Genetic algorithms have been used in science and engineering as adaptive algorithms for
solving practical problems and as computational models of natural evolutionary systems …

[图书][B] Neural networks: a systematic introduction

R Rojas - 2013 - books.google.com
Neural networks are a computing paradigm that is finding increasing attention among
computer scientists. In this book, theoretical laws and models previously scattered in the …

[HTML][HTML] Genetic algorithms for modelling and optimisation

J McCall - Journal of computational and Applied Mathematics, 2005 - Elsevier
Genetic algorithms (GAs) are a heuristic search and optimisation technique inspired by
natural evolution. They have been successfully applied to a wide range of real-world …

[PDF][PDF] Global optimization algorithms-theory and application

T Weise - Self-Published Thomas Weise, 2009 - researchgate.net
This e-book is devoted to global optimization algorithms, which are methods to find optimal
solutions for given problems. It especially focuses on Evolutionary Computation by …

[PDF][PDF] Exploiting open-endedness to solve problems through the search for novelty.

J Lehman, KO Stanley - ALIFE, 2008 - academia.edu
This paper establishes a link between the challenge of solving highly ambitious problems in
machine learning and the goal of reproducing the dynamics of open-ended evolution in …

[图书][B] The design of innovation: Lessons from and for competent genetic algorithms

DE Goldberg - 2002 - Springer
" It is well known that" building blocks", whether they be the atoms of chemistry, the words of
a language, or the modules of a computer, play a key role in our understanding of the world …

[PDF][PDF] Fitness distance correlation as a measure of problem difficulty for genetic algorithms.

T Jones, S Forrest - ICGA, 1995 - sfi-edu.s3.amazonaws.com
A measure of search difficulty, fitness distance correlation (FDC), is introduced and
examined in relation to genetic algorithm (GA) performance. In many cases, this correlation …