Artificial Evolution [[electronic resource] ] : Third European Conference, AE '97, Nimes, France, October 22-24, 1997, Selected Papers / / edited by Jin-Kao Hao, Evelyne Lutton, Edmund Ronald, Marc Schoenauer, Dominique Snyers |
Edizione | [1st ed. 1998.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
Descrizione fisica | 1 online resource (XII, 356 p.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Artificial intelligence
Computers Algorithms Pattern recognition Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Pattern Recognition |
ISBN | 3-540-69698-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | A template for scatter search and path relinking -- Representations, fitness functions and genetic operators for the satisfiability problem -- Genetic algorithms at the edge of a dream -- Mimetic evolution -- Adaptive penalties for evolutionary graph coloring -- An agent system for learning profiles in broadcasting applications on the Internet -- Application of evolutionary algorithms to protein folding prediction -- Telephone network traffic overloading diagnosis and evolutionary computation techniques -- Genetic algorithms for genetic mapping -- Inverse problems for finite automata: A solution based on genetic algorithms -- Evolving Turing machines from examples -- Genetic algorithms: Minimal conditions for convergence -- An analysis of punctuated equilibria in simple genetic algorithms -- SGA search dynamics on second order functions -- Asymptotical convergence rates of simple evolutionary algorithms under factorizing mutation distributions -- Wings were not designed to let animals fly -- Adaptation on the evolutionary time scale: A working hypothesis and basic experiments -- The frequency assignment problem: A look at the performance of evolutionary search -- A critical and empirical study of epistasis measures for predicting GA performances: A summary -- A priori comparison of binary crossover operators: No universal statistical measure, but a set of hints -- The dynamical nightwatch's problem solved by the autonomous micro-robot Khepera -- CoDi-1Bit : A simplified cellular automata based neuron model -- Million module neural systems evolution. |
Record Nr. | UNINA-9910767530103321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Artificial Evolution [[electronic resource] ] : European Conference, AE '95, Brest, France, September 4 - 6, 1995. Selected Papers. / / edited by Jean-Marc Alliot, Evelyne Lutton, Edmund Ronald, Marc Schoenauer, Dominique Snyers |
Edizione | [1st ed. 1996.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
Descrizione fisica | 1 online resource (XIV, 406 p.) |
Disciplina | 005.1 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Artificial intelligence
Computers Mathematical models Algorithms Pattern recognition Artificial Intelligence Theory of Computation Mathematical Modeling and Industrial Mathematics Computation by Abstract Devices Algorithm Analysis and Problem Complexity Pattern Recognition |
ISBN | 3-540-49948-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Evolution strategies: An alternative evolutionary algorithm -- An introduction to evolutionary programming -- An asymptotic theory for genetic algorithms -- Towards a genetic theory of easy and hard functions -- GAS, a concept on modeling species in genetic algorithms -- A genetic algorithm with parallel steady-state reproduction -- Induction-based control of genetic algorithms -- New multicriteria optimization method based on the use of a diploid genetic algorithm: Example of an industrial problem -- Lotka Volterra coevolution at the edge of chaos -- Evolution through cooperation: The Symbiotic Algorithm -- The artificial evolution of cooperation -- Immune system and fault-tolerant computing -- Modular genetic neural networks for 6-Legged locomotion -- An artificial life approach for the synthesis of autonomous agents -- How long does it take to evolve a neural net? -- Mixed IFS: Resolution of the inverse problem using genetic programming -- Interactive evolution for simulated natural evolution -- Building new tools for synthetic image animation by using evolutionary techniques -- A genetic algorithm with sharing for the detection of 2D geometric primitives in images -- A genetic algorithm to improve an Othello program -- A comparative study of a penalty function, a repair heuristic, and stochastic operators with the set-covering problem -- Study of genetic search for the Frequency Assignment Problem -- An application of evolutionary algorithms to the scheduling of robotic operations -- Genetic operators for two-dimentional shape optimization -- Air Traffic conflict resolution by Genetic Algorithms -- Optimizing hidden Markov models with a genetic algorithm. |
Record Nr. | UNISA-996465586703316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Learning and Intelligent Optimization [[electronic resource] ] : 6th International Conference, LION 6, Paris, France, January 16-20, 2012, Revised Selected Papers / / edited by Youssef Hamadi, Marc Schoenauer |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (XXIV, 514 p. 132 illus.) |
Disciplina | 006.31015196 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Artificial intelligence Numerical analysis Computer science Computer science—Mathematics Discrete mathematics Application software Artificial Intelligence Numerical Analysis Theory of Computation Discrete Mathematics in Computer Science Computer and Information Systems Applications |
ISBN | 3-642-34413-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Iterative-Deepening Search with On-Line Tree Size Prediction -- A Learning Optimization Algorithm in Graph Theory: Versatile Search for Extremal Graphs Using a Learning Algorithm -- A Math-Heuristic Dantzig-Wolfe Algorithm for the Capacitated Lot Sizing Problem -- Application of the Nested Rollout Policy Adaptation Algorithm to the Traveling Salesman Problem with Time Windows -- Parallel Algorithm Configuration -- Community Detection in Social and Biological Networks Using Differential Evolution -- A Study on Large Population MOEA Using Adaptive ε-Box Dominance and Neighborhood Recombination for Many -- Objective Optimization -- A Non-adaptive Stochastic Local Search Algorithm High-Dimensional Model-Based Optimization Based on Noisy Evaluations of Computer Games -- Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop Scheduling -- Minimizing Time When Applying Bootstrap to Contingency Tables Analysis of Genome-Wide Data -- Quantifying Homogeneity of Instance Sets for Algorithm Configuration -- Automatically Configuring Algorithms for Scaling Performance -- Upper Confidence Tree-Based Consistent Reactive Planning Application to MineSweeper -- Influence of the Migration Period in Parallel Distributed Gas for Dynamic Optimization -- A Hyper-Heuristic Inspired by Pearl Hunting -- Five Phase and Genetic Hive Hyper-Heuristics for the Cross-Domain Search -- Implicit Model Selection Based on Variable Transformations in Estimation of Distribution -- Improving the Exploration in Upper Confidence Trees -- Parallel GPU Implementation of Iterated Local Search for the Travelling Salesman Problem -- Evaluation of a Family of Reinforcement Learning Cross-Domain Optimization Heuristics.-Effect of SMS-EMOA Parameterizations on Hypervolume Decreases. - Effects of Speciation on Evolution of Neural Networks in Highly Dynamic Environments -- Natural Max-SAT Encoding of Min-SAT. A New Hyperheuristic Algorithm for Cross-Domain Search Problems -- Brain Cine-MRI Sequences Registration Using B-Spline Free-Form Deformations and MLSDO Dynamic Optimization Algorithm -- Global Optimization for Algebraic Geometry -- Clause Sharing in Parallel MaxSAT -- An Intelligent Hyper-Heuristic Framework for CHeSC 2011. . |
Record Nr. | UNISA-996465672803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Parallel Problem Solving from Nature - PPSN V [[electronic resource] ] : 5th International Conference, Amsterdam, The Netherlands, September 27-30, 1998, Proceedings / / edited by Agoston E. Eiben, Thomas Bäck, Marc Schoenauer, Hans-Paul Schwefel |
Edizione | [1st ed. 1998.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
Descrizione fisica | 1 online resource (XLVI, 1585 p.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Architecture, Computer Algorithms Microprocessors Computer programming Theory of Computation Computer System Implementation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Processor Architectures Programming Techniques |
ISBN | 3-540-49672-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Modelling genetic algorithms: From Markov chains to dependence with complete connections -- On the optimization of unimodal functions with the (1+1) evolutionary algorithm -- A timing analysis of convergence to fitness sharing equilibrium -- Where elitists start limping evolution strategies at ridge functions -- A bit-wise epistasis measure for binary search spaces -- Inside GA dynamics: Ground basis for comparison -- The effect of spin-flip symmetry on the performance of the simple GA -- Fitness distance correlation and Ridge functions -- Accelerating the convergence of evolutionary algorithms by fitness landscape approximation -- Modeling building-block interdependency -- Mutate large, but inherit small! On the analysis of rescaled mutations in ( )-ES with noisy fitness data -- Creating robust solutions by means of evolutionary algorithms -- Analytic curve detection from a noisy binary edge map using genetic algorithm -- A comparison of dominance mechanisms and simple mutation on non-stationary problems -- Adaptation to a changing environment by means of the feedback thermodynamical genetic algorithm -- Optimization with noisy function evaluations -- On risky methods for local selection under noise -- Polygenic inheritance — A haploid scheme that can outperform diploidy -- Averaging efficiently in the presence of noise -- Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive fitness function -- Varying fitness functions in genetic algorithms: Studying the rate of increase of the dynamic penalty terms -- Landscape changes and the performance of Mapping Based Constraint handling methods -- A decoder-based evolutionary algorithm for constrained parameter optimization problems -- A spatial predator-prey approach to multi-objective optimization: A preliminary study -- Selective breeding in a multiobjective genetic algorithm -- Niching and elitist models for MOGAs -- Parallel evolutionary optimisation with constraint propagation -- Methods to evolve legal phenotypes -- Multiobjective optimization using evolutionary algorithms — A comparative case study -- Utilizing dynastically optimal forma recombination in hybrid genetic algorithms -- Further experimentations on the scalability of the GEMGA -- Indexed memory as a generic protocol for handling vectors of data in genetic programming -- On genetic algorithms and lindenmayer systems -- Genome length as an evolutionary self-adaptation -- Restart scheduling for genetic algorithms -- A comparative study of global and local selection in evolution strategies -- UEGO, an abstract niching technique for global optimization -- Development of problem-specific evolutionary algorithms -- The effects of control parameters and restarts on search stagnation in evolutionary programming -- Accelerating the evolutionary-gradient-search procedure: Individual step sizes -- Extending population-based incremental learning to continuous search spaces -- Multi-parent recombination in genetic algorithms with search space boundary extension by mirroring -- Selective crossover in genetic algorithms: An empirical study -- Line-breeding schemes for combinatorial optimization -- Finding regions of uncertainty in learned models: An application to face detection -- On ZCS in multi-agent environments -- Empirical analysis of the factors that affect the Baldwin effect -- Promoting generalisation of learned behaviours in genetic programming -- Generalization in Wilson's classifier system -- Symbiotic coevolution of artificial neural networks and training data sets -- Information-theoretic analysis of a mobile agent's learning in a discrete state space -- The coevolution of antibodies for concept learning -- Does data-model co-evolution improve generalization performance of evolving learners? -- A corporate classifier system -- Applying diffusion to a cooperative coevolutionary model -- Studying parallel evolutionary algorithms: The cellular programming case -- Learning to avoid moving obstacles optimally for mobile robots using a genetic-fuzzy approach -- Evolutionary neural networks for nonlinear dynamics modeling -- Hybrid distributed real-coded genetic algorithms -- Mechanisms of emergent computation in cellular automata -- Towards designing neural network ensembles by evolution -- Selection of training data for neural networks by a genetic algorithm -- Discovery with genetic algorithm scheduling strategies for cellular automata -- Simple + parallel + local = cellular computing -- Evolution, learning and speech recognition in changing acoustic environments -- Ant colonies for adaptive routing in packet-switched communications networks -- The stud GA: A mini revolution? -- An island model based ant system with lookahead for the shortest supersequence problem -- Parameter-free Genetic Algorithm inspired by “disparity theory of evolution” -- Immune network dynamics for inductive problem solving -- Parallelization strategies for Ant Colony Optimization -- Self-organising pattern formation: Fruit flies and cell phones -- A new genetic local search algorithm for graph coloring -- Improving the performance of evolutionary algorithms for the satisfiability problem by refining functions -- Memetic algorithms and the fitness landscape of the graph bi-partitioning problem -- Investigating evolutionary approaches to adaptive database management against various quality of service metrics -- Genetic algorithm behavior in the MAXSAT domain -- An adaptive mutation scheme for a penalty-based graph-colouring GA -- Inver-over operator for the TSP -- Repair and brood selection in the traveling salesman problem -- The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt -- Load balancing in parallel circuit testing with annealing-based and genetic algorithms -- A heuristic combination method for solving job-shop scheduling problems -- Reduction of air traffic congestion by genetic algorithms -- Timetabling the classes of an entire university with an evolutionary algorithm -- Genetic algorithms for the Multiple Container Packing Problem -- Buffer memory optimization in DSP applications: An evolutionary approach -- The Breeder Genetic Algorithm for frequency assignment -- A permutation based Genetic Algorithm for minimum span frequency assignment -- Comparison of Evolutionary Algorithms for design optimization -- Aspects of digital evolution: Evolvability and architecture -- Integrated facility design using an evolutionary approach with a subordinate network algorithm -- An evolutionary algorithm for synthesizing optical thin-film designs -- Implementing genetic algorithms with sterical constraints for protein structure prediction -- Optimal placements of flexible objects: An adaptive simulated annealing approach -- Encapsulated Evolution strategies for the determination of group contribution model parameters in order to predict thermodynamic properties -- Recombination operators for evolutionary graph drawing -- Optimisation of density estimation models with evolutionary algorithms -- Genetic algorithm in parameter estimation of nonlinear dynamic systems -- Optimizing web page layout using an annealed genetic algorithm as client-side script -- Solving the capacitor placement problem in a radial distribution system using an adaptive genetic algorithm. |
Record Nr. | UNINA-9910143480903321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Parallel Problem Solving from Nature - PPSN V [[electronic resource] ] : 5th International Conference, Amsterdam, The Netherlands, September 27-30, 1998, Proceedings / / edited by Agoston E. Eiben, Thomas Bäck, Marc Schoenauer, Hans-Paul Schwefel |
Edizione | [1st ed. 1998.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
Descrizione fisica | 1 online resource (XLVI, 1585 p.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Architecture, Computer Algorithms Microprocessors Computer programming Theory of Computation Computer System Implementation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Processor Architectures Programming Techniques |
ISBN | 3-540-49672-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Modelling genetic algorithms: From Markov chains to dependence with complete connections -- On the optimization of unimodal functions with the (1+1) evolutionary algorithm -- A timing analysis of convergence to fitness sharing equilibrium -- Where elitists start limping evolution strategies at ridge functions -- A bit-wise epistasis measure for binary search spaces -- Inside GA dynamics: Ground basis for comparison -- The effect of spin-flip symmetry on the performance of the simple GA -- Fitness distance correlation and Ridge functions -- Accelerating the convergence of evolutionary algorithms by fitness landscape approximation -- Modeling building-block interdependency -- Mutate large, but inherit small! On the analysis of rescaled mutations in ( )-ES with noisy fitness data -- Creating robust solutions by means of evolutionary algorithms -- Analytic curve detection from a noisy binary edge map using genetic algorithm -- A comparison of dominance mechanisms and simple mutation on non-stationary problems -- Adaptation to a changing environment by means of the feedback thermodynamical genetic algorithm -- Optimization with noisy function evaluations -- On risky methods for local selection under noise -- Polygenic inheritance — A haploid scheme that can outperform diploidy -- Averaging efficiently in the presence of noise -- Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive fitness function -- Varying fitness functions in genetic algorithms: Studying the rate of increase of the dynamic penalty terms -- Landscape changes and the performance of Mapping Based Constraint handling methods -- A decoder-based evolutionary algorithm for constrained parameter optimization problems -- A spatial predator-prey approach to multi-objective optimization: A preliminary study -- Selective breeding in a multiobjective genetic algorithm -- Niching and elitist models for MOGAs -- Parallel evolutionary optimisation with constraint propagation -- Methods to evolve legal phenotypes -- Multiobjective optimization using evolutionary algorithms — A comparative case study -- Utilizing dynastically optimal forma recombination in hybrid genetic algorithms -- Further experimentations on the scalability of the GEMGA -- Indexed memory as a generic protocol for handling vectors of data in genetic programming -- On genetic algorithms and lindenmayer systems -- Genome length as an evolutionary self-adaptation -- Restart scheduling for genetic algorithms -- A comparative study of global and local selection in evolution strategies -- UEGO, an abstract niching technique for global optimization -- Development of problem-specific evolutionary algorithms -- The effects of control parameters and restarts on search stagnation in evolutionary programming -- Accelerating the evolutionary-gradient-search procedure: Individual step sizes -- Extending population-based incremental learning to continuous search spaces -- Multi-parent recombination in genetic algorithms with search space boundary extension by mirroring -- Selective crossover in genetic algorithms: An empirical study -- Line-breeding schemes for combinatorial optimization -- Finding regions of uncertainty in learned models: An application to face detection -- On ZCS in multi-agent environments -- Empirical analysis of the factors that affect the Baldwin effect -- Promoting generalisation of learned behaviours in genetic programming -- Generalization in Wilson's classifier system -- Symbiotic coevolution of artificial neural networks and training data sets -- Information-theoretic analysis of a mobile agent's learning in a discrete state space -- The coevolution of antibodies for concept learning -- Does data-model co-evolution improve generalization performance of evolving learners? -- A corporate classifier system -- Applying diffusion to a cooperative coevolutionary model -- Studying parallel evolutionary algorithms: The cellular programming case -- Learning to avoid moving obstacles optimally for mobile robots using a genetic-fuzzy approach -- Evolutionary neural networks for nonlinear dynamics modeling -- Hybrid distributed real-coded genetic algorithms -- Mechanisms of emergent computation in cellular automata -- Towards designing neural network ensembles by evolution -- Selection of training data for neural networks by a genetic algorithm -- Discovery with genetic algorithm scheduling strategies for cellular automata -- Simple + parallel + local = cellular computing -- Evolution, learning and speech recognition in changing acoustic environments -- Ant colonies for adaptive routing in packet-switched communications networks -- The stud GA: A mini revolution? -- An island model based ant system with lookahead for the shortest supersequence problem -- Parameter-free Genetic Algorithm inspired by “disparity theory of evolution” -- Immune network dynamics for inductive problem solving -- Parallelization strategies for Ant Colony Optimization -- Self-organising pattern formation: Fruit flies and cell phones -- A new genetic local search algorithm for graph coloring -- Improving the performance of evolutionary algorithms for the satisfiability problem by refining functions -- Memetic algorithms and the fitness landscape of the graph bi-partitioning problem -- Investigating evolutionary approaches to adaptive database management against various quality of service metrics -- Genetic algorithm behavior in the MAXSAT domain -- An adaptive mutation scheme for a penalty-based graph-colouring GA -- Inver-over operator for the TSP -- Repair and brood selection in the traveling salesman problem -- The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt -- Load balancing in parallel circuit testing with annealing-based and genetic algorithms -- A heuristic combination method for solving job-shop scheduling problems -- Reduction of air traffic congestion by genetic algorithms -- Timetabling the classes of an entire university with an evolutionary algorithm -- Genetic algorithms for the Multiple Container Packing Problem -- Buffer memory optimization in DSP applications: An evolutionary approach -- The Breeder Genetic Algorithm for frequency assignment -- A permutation based Genetic Algorithm for minimum span frequency assignment -- Comparison of Evolutionary Algorithms for design optimization -- Aspects of digital evolution: Evolvability and architecture -- Integrated facility design using an evolutionary approach with a subordinate network algorithm -- An evolutionary algorithm for synthesizing optical thin-film designs -- Implementing genetic algorithms with sterical constraints for protein structure prediction -- Optimal placements of flexible objects: An adaptive simulated annealing approach -- Encapsulated Evolution strategies for the determination of group contribution model parameters in order to predict thermodynamic properties -- Recombination operators for evolutionary graph drawing -- Optimisation of density estimation models with evolutionary algorithms -- Genetic algorithm in parameter estimation of nonlinear dynamic systems -- Optimizing web page layout using an annealed genetic algorithm as client-side script -- Solving the capacitor placement problem in a radial distribution system using an adaptive genetic algorithm. |
Record Nr. | UNISA-996466126803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|