Open AccessBook
Adaptation in natural and artificial systems
John H. Holland
- 01 Jan 1975
TL;DR: Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.
read more
Abstract: Name of founding work in the area. Adaptation is key to survival and evolution. Evolution implicitly optimizes organisims. AI wants to mimic biological optimization { Survival of the ttest { Exploration and exploitation { Niche nding { Robust across changing environments (Mammals v. Dinos) { Self-regulation,-repair and-reproduction 2 Artiicial Inteligence Some deenitions { "Making computers do what they do in the movies" { "Making computers do what humans (currently) do best" { "Giving computers common sense; letting them make simple deci-sions" (do as I want, not what I say) { "Anything too new to be pidgeonholed" Adaptation and modiication is root of intelligence Some (Non-GA) branches of AI: { Expert Systems (Rule based deduction)
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficient Data Collection in Wireless Sensor Networks with Path-Constrained Mobile Sinks
TL;DR: This work proposes a novel data collection scheme, called the Maximum Amount Shortest Path (MASP), that increases network throughput as well as conserves energy by optimizing the assignment of sensor nodes.
291
Genetic algorithm-optimized long short-term memory network for stock market prediction
Hyejung Chung,Kyung Shik Shin +1 more
TL;DR: This research investigates the temporal property of stock market data by suggesting a systematic method to determine the time window size and topology for the LSTM network using GA.
290
The zero/one multiple knapsack problem and genetic algorithms
Sami Khuri,Thomas Bäck,Jörg Heitkötter +2 more
- 06 Apr 1994
TL;DR: In this paper, a genetic algorithm, GENEsYs, is applied to an NP-complete problem, the 0/1 multiple knapsack problem, which allows for the breeding and participation of infeasible strings in the population.
290
Efficient Simulation Budget Allocation for Selecting an Optimal Subset
TL;DR: Preliminary numerical results indicate that the proposed new procedure has the potential to enhance computational efficiency for simulation optimization and the resulting allocations are superior to other methods in the literature that are tested, and the relative efficiency increases for larger problems.
290
Evolutionary computation in dynamic and uncertain environments
Shengxiang Yang,Yew-Soon Ong,Yaochu Jin +2 more
- 01 Mar 2007
TL;DR: This book provides a compilation on the state-of-the-art and recent advances of evolutionary algorithms in dynamic and uncertain environments within a unified model for evolutionary algorithms.
References
•Book
Petroleum Refinery Process Economics
Robert E. Maples
- 01 Feb 1993
TL;DR: In this paper, the reader is presented with an organized look at the yield data for refinery processes and how to use this information in performing process economic studies of various types, such as refining.
212
•Book
The Graphic Language of Neville Brody
Jon Wozencroft
- 01 Jan 1988
TL;DR: The second instalment in the continuing Neville Brody story appeared in this paper with three new typefaces: Blur, Pop, and FF Gothic, created for Fontshop International of Berlin, publishers of "FUSE", the inetractive magazine set up by Brody in 1990 as a new forum for experimental typography.
47
Related Papers (5)
[...]
David E. Goldberg,William Shakespeare +1 more
- 01 Jan 2002
James Kennedy,Russell C. Eberhart +1 more
- 06 Aug 2002