Parallel Problem Solving from Nature, PPSN XI: 11th International Conference, Krakov, Poland, September 11-15, 2010, Proceedings, Part I: Lecture Notes in Computer Science, cartea 6238
Editat de Robert Schaefer, Carlos Cotta, Joanna Kolodziej, Günter Rudolphen Limba Engleză Paperback – 3 sep 2010
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (2) | 391.54 lei 3-5 săpt. | |
| Springer Berlin, Heidelberg – 3 sep 2010 | 391.54 lei 3-5 săpt. | |
| Springer Berlin, Heidelberg – 3 sep 2010 | 638.15 lei 3-5 săpt. |
Din seria Lecture Notes in Computer Science
- 20%
Preț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 638.15 lei
Preț vechi: 750.76 lei
-15% Nou
Puncte Express: 957
Preț estimativ în valută:
112.92€ • 132.59$ • 99.11£
112.92€ • 132.59$ • 99.11£
Carte disponibilă
Livrare economică 06-20 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642158438
ISBN-10: 3642158439
Pagini: 764
Ilustrații: XXI, 742 p. 211 illus.
Greutate: 1.07 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642158439
Pagini: 764
Ilustrații: XXI, 742 p. 211 illus.
Greutate: 1.07 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
Professional/practitionerCuprins
Theory of Evolutionary Computing (I).- Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem.- Mirrored Sampling and Sequential Selection for Evolution Strategies.- Optimisation and Generalisation: Footprints in Instance Space.- Adaptive Drift Analysis.- Optimizing Monotone Functions Can Be Difficult.- Log-Linear Convergence of the Scale-Invariant (?/? w ,?)-ES and Optimal ? for Intermediate Recombination for Large Population Sizes.- Exploiting Overlap When Searching for Robust Optima.- Benchmarking Evolutionary Algorithms: Towards Exploratory Landscape Analysis.- One-Point Geometric Crossover.- When Does Dependency Modelling Help? Using a Randomized Landscape Generator to Compare Algorithms in Terms of Problem Structure.- First-Improvement vs. Best-Improvement Local Optima Networks of NK Landscapes.- Differential Mutation Based on Population Covariance Matrix.- General Lower Bounds for the Running Time of Evolutionary Algorithms.- A Binary Encoding Supporting Both Mutation and Recombination.- Towards Analyzing Recombination Operators in Evolutionary Search.- Theory of Evolutionary Computing (II).- Bidirectional Relation between CMA Evolution Strategies and Natural Evolution Strategies.- A Fine-Grained View of GP Locality with Binary Decision Diagrams as Ant Phenotypes.- Drift Analysis with Tail Bounds.- More Effective Crossover Operators for the All-Pairs Shortest Path Problem.- Comparison-Based Adaptive Strategy Selection with Bandits in Differential Evolution.- Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation.- An Archive Maintenance Scheme for Finding Robust Solutions.- Experimental Supplements to the Theoretical Analysis of Migration in the Island Model.- General Scheme for Analyzing RunningTimes of Parallel Evolutionary Algorithms.- Negative Drift in Populations.- Log(?) Modifications for Optimal Parallelism.- The Linkage Tree Genetic Algorithm.- An Analysis of the XOR Dynamic Problem Generator Based on the Dynamical System.- The Role of Degenerate Robustness in the Evolvability of Multi-agent Systems in Dynamic Environments.- Machine Learning, Classifier Systems, Image Processing.- Evolutionary Learning of Technical Trading Rules without Data-Mining Bias.- Using Computational Intelligence to Identify Performance Bottlenecks in a Computer System.- Selecting Small Audio Feature Sets in Music Classification by Means of Asymmetric Mutation.- Globally Induced Model Trees: An Evolutionary Approach.- Open-Ended Evolutionary Robotics: An Information Theoretic Approach.- A Novel Similarity-Based Crossover for Artificial Neural Network Evolution.- Indirect Encoding of Neural Networks for Scalable Go.- Comparison-Based Optimizers Need Comparison-Based Surrogates.- A Cooperative Coevolutionary Approach to Partitional Clustering.- Feature Selection for Multi-purpose Predictive Models: A Many-Objective Task.- Incorporating Domain Knowledge into Evolutionary Computing for Discovering Gene-Gene Interaction.- The Application of Pittsburgh-Style Learning Classifier Systems to Address Genetic Heterogeneity and Epistasis in Association Studies.- Threshold Selection, Mitosis and Dual Mutation in Cooperative Co-evolution: Application to Medical 3D Tomography.- Comparative Analysis of Search and Score Metaheuristics for Bayesian Network Structure Learning Using Node Juxtaposition Distributions.- Analyzing the Credit Default Swap Market Using Cartesian Genetic Programming.- Memetic Algorithms, Hybridized Techniques, Meta and Hyperheurisics.- A Memetic CooperativeOptimization Schema and Its Application to the Tool Switching Problem.- Ownership and Trade in Spatial Evolutionary Memetic Games.- A Hyper-Heuristic Approach to Strip Packing Problems.- Asymptotic Analysis of Computational Multi-Agent Systems.- Path-Guided Mutation for Stochastic Pareto Local Search Algorithms.- Scheduling English Football Fixtures over the Holiday Period Using Hyper-heuristics.- Graph Clustering Based Model Building.- How to Choose Solutions for Local Search in Multiobjective Combinatorial Memetic Algorithms.- Secure and Task Abortion Aware GA-Based Hybrid Metaheuristics for Grid Scheduling.- A Memetic Algorithm for the Pickup and Delivery Problem with Time Windows Using Selective Route Exchange Crossover.- Ant Based Hyper Heuristics with Space Reduction: A Case Study of the p-Median Problem.- A Study of Multi-parent Crossover Operators in a Memetic Algorithm.- A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover.- A Memetic Algorithm with Non Gradient-Based Local Search Assisted by a Meta-model.- Multiobjective Optimization, Theoretical Aspects.- Theoretically Investigating Optimal ?-Distributions for the Hypervolume Indicator: First Results for Three Objectives.- Convergence Rates of (1+1) Evolutionary Multiobjective Optimization Algorithms.- Tight Bounds for the Approximation Ratio of the Hypervolume Indicator.- Evolutionary Multiobjective Optimization Algorithm as a Markov System.- A Natural Evolution Strategy for Multi-objective Optimization.- Solving Multiobjective Optimization Problem by Constraint Optimization.- Enhancing Diversity for Average Ranking Method in Evolutionary Many-Objective Optimization.- Objective Space Partitioning Using Conflict Information for Many-Objective Optimization.- HowCrossover Speeds Up Evolutionary Algorithms for the Multi-criteria All-Pairs-Shortest-Path Problem.- Path Relinking on Many-Objective NK-Landscapes.- In Search of Equitable Solutions Using Multi-objective Evolutionary Algorithms.- Stopping Criteria for Genetic Algorithms with Application to Multiobjective Optimization.- Defining and Optimizing Indicator-Based Diversity Measures in Multiobjective Search.- On Expected-Improvement Criteria for Model-based Multi-objective Optimization.- Parameter Tuning Boosts Performance of Variation Operators in Multiobjective Optimization.
Caracteristici
Up to date results Fast conference proceedings State-of-the-art report