Switch to: Citations

References in:

Genetic algorithms: An overview

Complexity 1 (1):31-39 (1995)

Add references

You must login to add references.
  1. On the proper treatment of connectionism.Paul Smolensky - 1988 - Behavioral and Brain Sciences 11 (1):1-23.
    A set of hypotheses is formulated for a connectionist approach to cognitive modeling. These hypotheses are shown to be incompatible with the hypotheses underlying traditional cognitive models. The connectionist models considered are massively parallel numerical computational systems that are a kind of continuous dynamical system. The numerical variables in the system correspond semantically to fine-grained features below the level of the concepts consciously used to describe the task domain. The level of analysis is intermediate between those of symbolic cognitive models (...)
    Download  
     
    Export citation  
     
    Bookmark   750 citations  
  • The Evolution of Cooperation.Robert M. Axelrod - 1984 - Basic Books.
    The 'Evolution of Cooperation' addresses a simple yet age-old question; If living things evolve through competition, how can cooperation ever emerge? Despite the abundant evidence of cooperation all around us, there existed no purely naturalistic answer to this question until 1979, when Robert Axelrod famously ran a computer tournament featuring a standard game-theory exercise called The Prisoner's Dilemma. To everyone's surprise, the program that won the tournament, named Tit for Tat, was not only the simplest but the most "cooperative" entrant. (...)
    Download  
     
    Export citation  
     
    Bookmark   958 citations  
  • Generalizing the notion of schema in genetic algorithms.Michael D. Vose - 1991 - Artificial Intelligence 50 (3):385-396.
    Download  
     
    Export citation  
     
    Bookmark   2 citations