Fr. 70.00

Genetic and Evolutionary Computation - GECCO 2004. Vol.1 - Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings

Anglais · Livre de poche

Expédition généralement dans un délai de 6 à 7 semaines

Description

En savoir plus

The two volume set LNCS 3102/3103 constitutes the refereed proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2004, held in Seattle, WA, USA, in June 2004.
The 230 revised full papers and 104 poster papers presented were carefully reviewed and selected from 460 submissions. The papers are organized in topical sections on artificial life, adaptive behavior, agents, and ant colony optimization; artificial immune systems, biological applications; coevolution; evolutionary robotics; evolution strategies and evolutionary programming; evolvable hardware; genetic algorithms; genetic programming; learning classifier systems; real world applications; and search-based software engineering.

Table des matières

A-Life, Adaptive Behavior, Agents, and Ant Colony Optimization.- A-Life, Adaptive Behavior, Agents, and Ant Colony Optimization - Posters.- Artificial Immune Systems.- Artificial Immune Systems - Posters.- Biological Applications.- Biological Applications - Posters.- Coevolution.- Coevolution - Posters.- Evolutionary Robotics.- Evolutionary Robotics - Poster.- Evolution Strategies/Evolutionary Programming.- Evolution Strategies/Evolutionary Programming - Posters.- Evolvable Hardware.- Genetic Algorithms.

Résumé

The two volume set LNCS 3102/3103 constitutes the refereed proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2004, held in Seattle, WA, USA, in June 2004.
The 230 revised full papers and 104 poster papers presented were carefully reviewed and selected from 460 submissions. The papers are organized in topical sections on artificial life, adaptive behavior, agents, and ant colony optimization; artificial immune systems, biological applications; coevolution; evolutionary robotics; evolution strategies and evolutionary programming; evolvable hardware; genetic algorithms; genetic programming; learning classifier systems; real world applications; and search-based software engineering.

Détails du produit

Collaboration Wolfgang Banzhaf (Editeur), Hans-Georg Beyer (Editeur), Edmund Burke (Editeur), Paul Darwen (Editeur), Dipankar Dasgupta (Editeur), Kalyanmoy Deb (Editeur), Dario Floreano (Editeur), James Foster (Editeur), James A. Foster (Editeur), Mark Harman (Editeur), Owen Holland (Editeur), Pier Luca Lanzi (Editeur), Riccardo Poli (Editeur), Lee Spector (Editeur), Andrea Tettamanzi (Editeur), Andrea G. B. Tettamanzi (Editeur), Dirk Thierens (Editeur), Andy Tyrrell (Editeur)
Edition Springer, Berlin
 
Langues Anglais
Format d'édition Livre de poche
Sortie 01.01.2004
 
EAN 9783540223443
ISBN 978-3-540-22344-3
Pages 1448
Poids 1680 g
Illustrations C, 1448 p. In 2 volumes, not available separately.
Thèmes Lecture Notes in Computer Science
Lecture Notes in Computer Science
Catégories Sciences naturelles, médecine, informatique, technique > Informatique, ordinateurs > Informatique

C, Künstliche Intelligenz, Algorithmen und Datenstrukturen, Algorithms, Artificial Intelligence, Diskrete Mathematik, DV-gestützte Biologie/Bioinformatik, Rechnerarchitektur und Logik-Entwurf, Microprocessors, Mathematik für Informatiker, computer science, molecular biology, bioinformatics, Theory of Computation, Discrete Mathematics in Computer Science, Discrete Mathematics, Computers, Algorithms & data structures, Information technology: general issues, Computer science—Mathematics, Maths for computer scientists, Algorithm Analysis and Problem Complexity, Computer architecture & logic design, Processor Architectures, Computation by Abstract Devices

Commentaires des clients

Aucune analyse n'a été rédigée sur cet article pour le moment. Sois le premier à donner ton avis et aide les autres utilisateurs à prendre leur décision d'achat.

Écris un commentaire

Super ou nul ? Donne ton propre avis.

Pour les messages à CeDe.ch, veuillez utiliser le formulaire de contact.

Il faut impérativement remplir les champs de saisie marqués d'une *.

En soumettant ce formulaire, tu acceptes notre déclaration de protection des données.