Parallel Problem Solving from Nature [[electronic resource] ] : 1st Workshop, PPSN I Dortmund, FRG, October 1-3, 1990. Proceedings / / edited by Hans-Paul Schwefel, Reinhard Männer |
Edizione | [1st ed. 1991.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
Descrizione fisica | 1 online resource (XI, 489 p.) |
Disciplina | 004/.35 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Applied mathematics
Engineering mathematics Architecture, Computer Computers Algorithms Microprocessors Applications of Mathematics Computer System Implementation Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Processor Architectures |
ISBN | 3-540-70652-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Global convergence of genetic algorithms: A markov chain analysis -- The theory of virtual alphabets -- Towards an optimal mutation probability for genetic algorithms -- An alternative Genetic Algorithm -- An analysis of the interacting roles of population size and crossover in genetic algorithms -- Gleam a system for simulated "intuitive learning" -- Genetic algorithms and highly constrained problems: The time-table case -- An evolution standing on the design of redundant manipulators -- Redundant coding of an NP-complete problem allows effective Genetic Algorithm search -- Circuit partitioning with genetic algorithms using a coding scheme to preserve the structure of a circuit -- Genetic algorithms, production plan optimisation and scheduling -- System identification using genetic algorithms -- Conformational analysis of DNA using genetic algorithms -- Operator-oriented genetic algorithm and its application to sliding block puzzle problem -- A topology exploiting genetic algorithm to control dynamic systems -- Genetic local search algorithms for the traveling salesman problem -- Genetic programming artificial nervous systems artificial embryos and embryological electronics -- Concept formation and decision tree induction using the genetic programming paradigm -- On solving travelling salesman problems by genetic algorithms -- Genetic algorithms and punctuated equilibria in VLSI -- Implementing the genetic algorithm on transputer based parallel processing systems -- Explicit parallelism of genetic algorithms through population structures -- Parallel genetic packing of rectangles -- Partitioning a graph with a parallel genetic algorithm -- Solving the mapping-problem — Experiences with a genetic algorithm -- Optimization using distributed genetic algorithms -- Application of the Evolutionsstrategie to discrete optimization problems -- A variant of evolution strategies for vector optimization -- Application of evolution strategy in parallel populations -- Global optimization by means of distributed evolution strategies -- Solving sequential games with Boltzmann-learned tactics -- Optimizing simulated annealing -- Parallel Implementations Of Simulated Annealing / A local timing model for parallel optimization with Boltzmann Machines -- Error-free parallel implementation of simulated annealing -- Trimm: A parallel processor for image reconstruction by simulated annealing -- The response-time constraint in neural evolution -- An artificial neural network representation for artificial organisms -- Feature construction for back-propagation -- Improved convergence rate of back-propagation with dynamic adaption of the learning rate -- Performance evaluation of evolutionarily created neural network topologies -- Optical image preprocessing for neural network classifier system -- Gannet: Genetic design of a neural net for face recognition -- The application of a genetic approach as an algorithm for neural networks -- Genetic improvements of feedforward nets for approximating functions -- Exploring adaptive agency III: Simulating the evolution of habituation and sensitization -- A learning strategy for neural networks based on a modified evolutionary strategy -- Genetic algorithms and the immune system -- Selectionist categorization -- A classifier system with integrated genetic operators -- The fuzzy classifier system: Motivations and first results -- Hints for adaptive problem solving gleaned from immune networks -- A reactive robot navigation system based on a fluid dynamics metaphor -- Transfer of natural metaphors to parallel problem solving applications -- Modelling and simulation of distributed evolutionary search processes for function optimization -- Parallel, decentralized spatial mapping for robot navigation and path planning -- Ecological dynamics under different selection rules in distributed and iterated prisoner's dilemma game -- Adaptation in signal spaces -- A principle of minimum complexity in evolution -- The emergence of data structures from local interactions -- The view from the adaptive landscape -- Boltzmann-, Darwin- and Haeckel-strategies in optimization problems -- Optimizing complex problems by nature's algorithms: Simulated annealing and evolution strategy—a comparative study -- Genetic Algorithms and evolution strategies: Similarities and differences -- Building the ultimate machine: The emergence of artificial cognition. |
Record Nr. | UNISA-996465530303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Parallel Problem Solving from Nature - PPSN IV [[electronic resource] ] : International Conference on Evolutionary Computation. The 4th International Conference on Parallel Problem Solving from Nature Berlin, Germany, September 22 - 26, 1996. Proceedings / / edited by Werner Ebeling, Ingo Rechenberg, Hans-Paul Schwefel, Hans-Michael Voigt |
Edizione | [1st ed. 1996.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
Descrizione fisica | 1 online resource (XVIII, 1058 p.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Architecture, Computer Software engineering Microprocessors Algorithms Artificial intelligence Computation by Abstract Devices Computer System Implementation Software Engineering/Programming and Operating Systems Processor Architectures Algorithm Analysis and Problem Complexity Artificial Intelligence |
ISBN | 3-540-70668-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Computational brittleness and the evolution of computer viruses -- Evolutionary computing in multi-agent environments: Speciation and symbiogenesis -- Evolution strategies with subjective selection -- Emergent cooperation for multiple agents using genetic programming -- Evolution programs evolved -- Encoding scheme issues for open-ended artificial evolution -- Hardware evolution at function level -- Coevolutionary life-time learning -- Genetic programs and co-evolution -- Self-assemblage of gene nets in evolution via recruiting of new netters -- A survey of intron research in genetics -- Analytical and numerical investigations of evolutionary algorithms in continuous spaces -- On the asymptotic behavior of multirecombinant Evolution Strategies -- Are long path problems hard for genetic algorithms? -- Random tree generation for genetic programming -- Implicit formae in genetic algorithms -- A probabilistic database approach to the analysis of genetic algorithms -- Mean field analysis of tournament selection on a random manifold -- From recombination of genes to the estimation of distributions I. Binary parameters -- From recombination of genes to the estimation of distributions II. Continuous parameters -- Searching in the presence of noise -- The density of states — A measure of the difficulty of optimisation problems -- On interactive evolutionary algorithms and stochastic mealy automata -- The influence of different coding schemes on the computational complexity of genetic algorithms in function optimization -- An analysis of the effects of neighborhood size and shape on local selection algorithms -- Evolutionary computation at the edge of feasibility -- Dimensional analysis of allele-wise mixing revisited -- Gaussian diffusion in a simple genetic algorithm -- Erroneous truncation selection — A breeder's decision making perspective -- New crossover methods for sequencing problems -- The effect of extensive use of the mutation operator on generalization in genetic programming using sparse data sets -- On permutation representations for scheduling problems -- Multi-parent's niche: N-ary crossovers on NK-landscapes -- A preliminary investigation into directed mutations in evolutionary algorithms -- Heuristic crossovers for real-coded genetic algorithms based on fuzzy connectives -- Are evolutionary algorithms improved by large mutations? -- Mutation by imitation in boolean evolution strategies -- Formal algorithms + formal representations =search strategies -- A genetic algorithm with variable range of local search for tracking changing environments -- An Evolution Strategy with adaptation of the step sizes by a variance function -- Every niching method has its niche: Fitness sharing and implicit sharing compared -- Effects of isolation in a distributed population genetic algorithm -- Self-adaptive genetic algorithm for numeric functions -- Niche search: An evolutionary algorithm for global optimisation -- Adaptively parameterised evolutionary systems: Self adaptive recombination and mutation in a genetic algorithm -- Obtaining multiple distinct solutions with genetic algorithm niching methods -- Cost Based Operator Rate Adaptation: An investigation -- Genetic algorithms and relational landscapes -- IOGA: An instance-oriented genetic algorithm -- Explicit filtering of building blocks for genetic algorithms -- Multi-objective optimization by means of the thermodynamical genetic algorithm -- Adaptation to a changing environment by means of the thermodynamical genetic algorithm -- The development of a dual-agent strategy for efficient search across whole system engineering design hierarchies -- A parallel cellular genetic algorithm used in finite element simulation -- A robust solution searching scheme in genetic search -- Solving MasterMind using GAs and simulated annealing: A case of dynamic constraint optimization -- Evolving compact solutions in genetic programming: A case study -- Climbing up NP-hard hills -- On the performance assessment and comparison of stochastic multiobjective optimizers -- Paginating the generalized newspapers — A comparison of simulated annealing and a heuristic method -- A comparison of optimization techniques for integrated manufacturing planning and scheduling -- A comparison of search techniques on a wing-box optimisation problem -- A comparative study of evolutionary algorithms for on-line parameter tracking -- Modeling urban growth by cellular automata -- Democratic optimization for discrete and continuous systems -- A study of some properties of Ant-Q -- Immunoid: An immunological approach to decentralized behavior arbitration of autonomous mobile robots -- Parallelizable evolutionary dynamics principles for solving the maximum clique problem -- Significance of locality and selection pressure in the grand deluge evolutionary algorithm -- Parallel computing with DNA: Toward the anti-universal machine -- Tackling the “curse of dimensionality” of radial basis functional neural networks using a genetic algorithm -- A Three-stage method for designing Genetic Fuzzy Systems by learning from examples -- Learning heuristics for OBDD minimization by Evolutionary Algorithms -- Improving the generalization performance of multi-layer-perceptrons with population-based incremental learning -- Robust GP in robot learning -- A pattern recognition system using evolvable hardware -- Topology design of feedforward neural networks by genetic algorithms -- An evolution strategy for on-line optimisation of dynamic objective functions -- Exploiting competing subpopulations for automatic generation of test sequences for digital circuits -- Constraint handling in evolutionary search: A case study of the frequency assignment -- An application of genetic algorithms and neural networks to scheduling power generating systems -- Evolutionary algorithms for the calculation of electron distributions in Si-MOSFETs -- Refueling of a nuclear power plant: Comparison of a naive and a specialized mutation operator -- Genetic algorithms applied to the physical design of VLSI circuits: A survey -- Stochastic methods for transistor size optimization of CMOS VLSI circuits -- An adaptive parallel Genetic Algorithm for VLSI-layout optimization -- Genetic algorithms for protocol validation -- Constraint handling for the fault coverage code generation problem: An inductive evolutionary approach -- New genetic local search operators for the traveling salesman problem -- An evolutionary approach to hardware/software partitioning -- Evolutionary Air Traffic Flow Management for large 3D-problems -- Genetic-based dynamic load balancing: Implementation and evaluation -- Production scheduling with genetic algorithms and simulation -- Network optimization using evolutionary strategies -- Co-evolving parallel random number generators -- Scheduling by genetic local search with multi-step crossover -- Finding the conformation of organic molecules with genetic algorithms -- Investigating a Parallel Breeder Genetic Algorithm on the inverse Aerodynamic design -- An evolutionary design for f-? lenses -- Optimization of heat exchanger networks by means of evolution strategies -- Industrial plant pipe-route optimisation with genetic algorithms -- An evolutionary algorithm for design optimization of microsystems -- A learning classifier system for three-dimensional shape optimization. |
Record Nr. | UNISA-996465784503316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
![]() | ||
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 | ||
![]() | ||
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 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Parallel Problem Solving from Nature - PPSN VIII [[electronic resource] ] : 8th International Conference, Birmingham, UK, September 18-22, 2004, Proceedings / / edited by Xin Yao, Edmund Burke, Jose A. Lozano, Jim Smith, Juan J. Merelo-Guervós, John A. Bullinaria, Jonathan Rowe, Peter Tino, Ata Kabán, Hans-Paul Schwefel |
Edizione | [1st ed. 2004.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
Descrizione fisica | 1 online resource (XL, 1188 p.) |
Disciplina | 004/.35 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Architecture, Computer
Computers Algorithms Computer programming Software engineering Artificial intelligence Computer System Implementation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Programming Techniques Software Engineering Artificial Intelligence |
ISBN | 3-540-30217-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Theory -- New Algorithms -- Applications -- Multi-objective Optimisation -- Co-evolution -- Robotics and Multi-agent Systems -- Learning Classifier Systems and Data Mining. |
Record Nr. | UNISA-996465711903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Parallel Problem Solving from Nature - PPSN VIII : 8th International Conference, Birmingham, UK, September 18-22, 2004, Proceedings / / edited by Xin Yao, Edmund Burke, Jose A. Lozano, Jim Smith, Juan J. Merelo-Guervós, John A. Bullinaria, Jonathan Rowe, Peter Tino, Ata Kabán, Hans-Paul Schwefel |
Edizione | [1st ed. 2004.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
Descrizione fisica | 1 online resource (XL, 1188 p.) |
Disciplina | 004/.35 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Architecture, Computer
Computers Algorithms Computer programming Software engineering Artificial intelligence Computer System Implementation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Programming Techniques Software Engineering Artificial Intelligence |
ISBN | 3-540-30217-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Theory -- New Algorithms -- Applications -- Multi-objective Optimisation -- Co-evolution -- Robotics and Multi-agent Systems -- Learning Classifier Systems and Data Mining. |
Record Nr. | UNINA-9910144608803321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Parallel problem solving from nature-- PPSN III : International Conference on Evolutionary Computation, the Third Conference on Parallel Problem Solving from Nature, Jerusalem, Israel, October 9-14, 1994 : proceedings / / Yuval Davidor, Hans-Paul Schwefel, Reinhard Männer, (eds.) |
Pubbl/distr/stampa | Springer Berlin Heidelberg |
Disciplina | 006.3 |
Altri autori (Persone) |
MännerReinhard
DavidorYuval SchwefelHans-Paul |
Soggetto topico |
Parallel processing (Electronic computers) - Congresses
Evolutionary computation |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Altri titoli varianti | Parallel Problem Solving from Nature — PPSN III |
Record Nr. | UNISA-996466146503316 |
Springer Berlin Heidelberg | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|