Progress in Evolutionary Computation: AI '93 and AI '94 Workshops on Evolutionary Computation, Melbourne, Victoria, Australia, November 16, 1993, Armidale, NSW, Australia, November 21-22, 1994. Selected Papers: Lecture Notes in Computer Science, cartea 956
Editat de Xin Yaoen Limba Engleză Paperback – 10 aug 1995
The 21 papers included cover a wide range of topics in the field of evolutionary computation, from constrained function optimization to combinatorial optimization, from evolutionary programming to genetic programming, from robotic strategy learning to co-evolutionary game strategy learning. The papers reflect important recent progress in the field; more than half of the papers come from overseas.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 449.57 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 18% Preț: 938.83 lei
- 20% Preț: 591.51 lei
- 15% Preț: 438.59 lei
- 20% Preț: 337.00 lei
- Preț: 389.48 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- 20% Preț: 649.49 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 333.88 lei
Preț vechi: 417.34 lei
-20% Nou
Puncte Express: 501
Preț estimativ în valută:
63.89€ • 66.70$ • 52.88£
63.89€ • 66.70$ • 52.88£
Carte tipărită la comandă
Livrare economică 05-19 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540601548
ISBN-10: 3540601546
Pagini: 328
Ilustrații: X, 318 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.46 kg
Ediția:1995
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540601546
Pagini: 328
Ilustrații: X, 318 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.46 kg
Ediția:1995
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
The effect of function noise on GP efficiency.- Genetic approaches to learning recursive relations.- An application of Genetic Programming to the 4-Op problem using map-trees.- Direct replacement: A Genetic Algorithm without mutation which avoids deception.- Competitive evolution: A natural approach to operator selection.- Emergent collective computational abilities in interacting particle systems.- A perspective on evolutionary computation.- An experimental study of N-Person Iterated Prisoner's Dilemma games.- A systolic architecture for high speed hypergraph partitioning using a genetic algorithm.- Development of hybrid optimisation techniques based on genetic algorithms and simulated annealing.- Development of parallel hybrid optimisation techniques based on genetic algorithms and simulated annealing.- Genetic algorithms for cutting stock problems: With and without contiguity.- GASBOR: A genetic algorithm for switchbox routing in integrated circuits.- The calculus of self-modifiable algorithm based evolutionary computer network routing.- Evolving robot strategy for open ended game.- An evolutionary approach to adaptive model-building.- Training neural networks with influence diagrams.- A behavioural theory of intelligent machines as a framework for the analysis of adaptation.- On evolving robust strategies for iterated prisoner's dilemma.- Comparison of heuristic search algorithms for single machine scheduling problems.- Encoding graphs for genetic algorithms: An investigation using the minimum spanning tree problem.