LEADER 01245nam 2200313Ia 450 001 996385061003316 005 20200824132550.0 035 $a(CKB)4940000000073449 035 $a(EEBO)2240898097 035 $a(OCoLC)ocm11747582e 035 $a(OCoLC)11747582 035 $a(EXLCZ)994940000000073449 100 $a19850228d1679 uy | 101 0 $aeng 135 $aurbn||||a|bb| 200 14$aThe Church of Rome unmask'd, or her false principles briefly detected$b[electronic resource] $ewith some reasons of so many retaining or returning to communion with her, and the great danger of everlasting destruction, that such persons, especially after separations from her, return to her communion, do run themselves on /$fwritten by a learned divine, by way of letter to a friend in the country 210 $aLondon $cPrinted for Isaac Cleave$d1679 215 $a[2], 74 p 300 $aReproduction of original in Huntington Library. 330 $aeebo-0113 700 $aLearned divine$01004508 801 0$bEAA 801 1$bEAA 801 2$bm/c 801 2$bWaOLN 906 $aBOOK 912 $a996385061003316 996 $aThe Church of Rome unmask'd, or her false principles briefly detected$92361121 997 $aUNISA LEADER 09057nam 22008055 450 001 996465943503316 005 20230222132813.0 010 $a3-642-15844-7 024 7 $a10.1007/978-3-642-15844-5 035 $a(CKB)2670000000045112 035 $a(SSID)ssj0000446679 035 $a(PQKBManifestationID)11249949 035 $a(PQKBTitleCode)TC0000446679 035 $a(PQKBWorkID)10504329 035 $a(PQKB)10319639 035 $a(DE-He213)978-3-642-15844-5 035 $a(MiAaPQ)EBC3065898 035 $a(PPN)149031769 035 $a(EXLCZ)992670000000045112 100 $a20100913d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aParallel Problem Solving from Nature, PPSN XI$b[electronic resource] $e11th International Conference, Krakov, Poland, September 11-15, 2010, Proceedings, Part I /$fedited by Robert Schaefer, Carlos Cotta, Joanna Kolodziej, Günter Rudolph 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XXI, 742 p. 211 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6238 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-15843-9 320 $aIncludes bibliographical references and index. 327 $aTheory 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6238 606 $aBioinformatics 606 $aArtificial intelligence 606 $aComputer science 606 $aAlgorithms 606 $aPattern recognition systems 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputational and Systems Biology 606 $aArtificial Intelligence 606 $aTheory of Computation 606 $aAlgorithms 606 $aAutomated Pattern Recognition 606 $aDiscrete Mathematics in Computer Science 615 0$aBioinformatics. 615 0$aArtificial intelligence. 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aPattern recognition systems. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 14$aComputational and Systems Biology. 615 24$aArtificial Intelligence. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aAutomated Pattern Recognition. 615 24$aDiscrete Mathematics in Computer Science. 676 $a570.285 702 $aSchaefer$b Robert$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aCotta$b Carlos$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKolodziej$b Joanna$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRudolph$b Günter$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465943503316 996 $aParallel Problem Solving from Nature, PPSN XI$92596797 997 $aUNISA