|
|
|
|
LEADER |
08273nam a22006015i 4500 |
001 |
978-3-642-15844-5 |
003 |
DE-He213 |
005 |
20151204153023.0 |
007 |
cr nn 008mamaa |
008 |
100913s2010 gw | s |||| 0|eng d |
020 |
|
|
|a 9783642158445
|9 978-3-642-15844-5
|
024 |
7 |
|
|a 10.1007/978-3-642-15844-5
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QH324.2-324.25
|
072 |
|
7 |
|a PSA
|2 bicssc
|
072 |
|
7 |
|a UB
|2 bicssc
|
072 |
|
7 |
|a COM014000
|2 bisacsh
|
082 |
0 |
4 |
|a 570.285
|2 23
|
245 |
1 |
0 |
|a Parallel Problem Solving from Nature, PPSN XI
|h [electronic resource] :
|b 11th International Conference, Kraków, Poland, September 11-15, 2010, Proceedings, Part I /
|c edited by Robert Schaefer, Carlos Cotta, Joanna Kołodziej, Günter Rudolph.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2010.
|
300 |
|
|
|a XXI, 742 p. 211 illus.
|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 6238
|
505 |
0 |
|
|a 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 Running Times 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 Cooperative Optimization 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 -- How Crossover 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.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Computer science
|x Mathematics.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
|
0 |
|a Pattern recognition.
|
650 |
|
0 |
|a Bioinformatics.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Computational Biology/Bioinformatics.
|
650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Pattern Recognition.
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
700 |
1 |
|
|a Schaefer, Robert.
|e editor.
|
700 |
1 |
|
|a Cotta, Carlos.
|e editor.
|
700 |
1 |
|
|a Kołodziej, Joanna.
|e editor.
|
700 |
1 |
|
|a Rudolph, Günter.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642158438
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 6238
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-15844-5
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|