Foundations of Genetic Algorithms 8th International Workshop, FOGA 2005, Aizu-Wakamatsu City, Japan, January 5 - 9 , 2005, Revised Selected Papers /

The8thWorkshopontheFoundationsofGeneticAlgorithms,FOGA-8,washeld at the University of Aizu in Aizu-Wakamatsu City, Japan, January 5–9, 2005. This series of workshops was initiated in 1990 to encourage further research on the theoretical aspects of genetic algorithms, and the workshops have been held...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Wright, Alden H. (Επιμελητής έκδοσης), Vose, Michael D. (Επιμελητής έκδοσης), Jong, Kenneth A. De (Επιμελητής έκδοσης), Schmitt, Lothar M. (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
Σειρά:Lecture Notes in Computer Science, 3469
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04896nam a22005775i 4500
001 978-3-540-32035-7
003 DE-He213
005 20151204152306.0
007 cr nn 008mamaa
008 100925s2005 gw | s |||| 0|eng d
020 |a 9783540320357  |9 978-3-540-32035-7 
024 7 |a 10.1007/b138412  |2 doi 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
072 7 |a UYZG  |2 bicssc 
072 7 |a COM037000  |2 bisacsh 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Foundations of Genetic Algorithms  |h [electronic resource] :  |b 8th International Workshop, FOGA 2005, Aizu-Wakamatsu City, Japan, January 5 - 9 , 2005, Revised Selected Papers /  |c edited by Alden H. Wright, Michael D. Vose, Kenneth A. De Jong, Lothar M. Schmitt. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2005. 
300 |a X, 314 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 3469 
505 0 |a Genetic Algorithms for the Variable Ordering Problem of Binary Decision Diagrams -- Gray, Binary and Real Valued Encodings: Quad Search and Locality Proofs -- A Comparison of Simulated Annealing with a Simple Evolutionary Algorithm -- NP-Completeness of Deciding Binary Genetic Encodability -- Compact Genetic Codes as a Search Strategy of Evolutionary Processes -- Asymptotic Convergence of Some Metaheuristics Used for Multiobjective Optimization -- Running Time Analysis of a Multiobjective Evolutionary Algorithm on Simple and Hard Problems -- Tournament Selection, Iterated Coupon-Collection Problem, and Backward-Chaining Evolutionary Algorithms -- A Schema-Based Version of Geiringer’s Theorem for Nonlinear Genetic Programming with Homologous Crossover -- Coarse Graining Selection and Mutation -- Perturbation Theory and the Renormalization Group in Genetic Dynamics -- Optimal Weighted Recombination -- On the Prediction of the Solution Quality in Noisy Optimization -- Rigorous Runtime Analysis of the (1+1) ES: 1/5-Rule and Ellipsoidal Fitness Landscapes -- Population Sizing of Dependency Detection by Fitness Difference Classification -- The Deceptive Degree of the Objective Function. 
520 |a The8thWorkshopontheFoundationsofGeneticAlgorithms,FOGA-8,washeld at the University of Aizu in Aizu-Wakamatsu City, Japan, January 5–9, 2005. This series of workshops was initiated in 1990 to encourage further research on the theoretical aspects of genetic algorithms, and the workshops have been held biennially ever since. The papers presented at these workshops are revised, edited and published as volumes during the year following each workshop. This series of (now eight) volumes provides an outstanding source of reference for the theoretical work in this ?eld. At the same time this series of volumes provides a clear picture of how the theoretical research has grown and matured along with the ?eld to encompass many evolutionary computation paradigms including evolution strategies (ES), evolutionary programming (EP), and genetic programming (GP), as well as the continuing growthininteractionswith other ?elds suchas mathematics,physics, and biology. Atraditionoftheseworkshopsisorganizetheminsuchawayastoencourage lots of interaction and discussion by restricting the number of papers presented and the number of attendees, and by holding the workshop in a relaxed and informal setting. This year’s workshop was no exception. Thirty-two researchers met for 3 days to present and discuss 16 papers. The local organizer was Lothar Schmitt who, together with help and support from his university, provided the workshop facilities. Aftertheworkshopwasover,theauthorsweregiventheopportunitytorevise their papers based on the feedback they received from the other participants. 
650 0 |a Computer science. 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Artificial intelligence. 
650 0 |a Evolutionary biology. 
650 0 |a Biomathematics. 
650 1 4 |a Computer Science. 
650 2 4 |a Computation by Abstract Devices. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
650 2 4 |a Evolutionary Biology. 
650 2 4 |a Genetics and Population Dynamics. 
700 1 |a Wright, Alden H.  |e editor. 
700 1 |a Vose, Michael D.  |e editor. 
700 1 |a Jong, Kenneth A. De.  |e editor. 
700 1 |a Schmitt, Lothar M.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540272373 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 3469 
856 4 0 |u http://dx.doi.org/10.1007/b138412  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)