Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Evolutionary Programming VII [[electronic resource] ] : 7th International Conference, EP98, San Diego, California, USA, March 25–27, 1998 Proceedings / / edited by V.W. Porto, N. Saravanan, D. Waagen, A.E. Eiben
| Evolutionary Programming VII [[electronic resource] ] : 7th International Conference, EP98, San Diego, California, USA, March 25–27, 1998 Proceedings / / edited by V.W. Porto, N. Saravanan, D. Waagen, A.E. Eiben |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (XVI, 840 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer programming Microprocessors Artificial intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Programming Techniques Processor Architectures Artificial Intelligence |
| ISBN | 3-540-68515-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The cumulative consensus of cognitive agents in scenarios: A framework for evolutionary processes in semantic memory -- Preferential partner selection in evolutionary labor markets: A study in agent-based computational economics -- Subspace pursuit for exploratory modeling -- Complete classes of strategies for the Classical Iterated Prisoner's Dilemma -- Evolutionary computing in multi-agent environments: Operators -- Evaluation of a simple host-parasite genetic algorithm -- Testing three paradigms for evolving groups of cooperative, simple agents -- Acquisition of general adaptive features by evolution -- Hybrid interior-lagrangian penalty based evolutionary optimization -- GA-Optimal fitness functions -- Scaling up evolutionary programming algorithms -- Short notes on the schema theorem and the building block hypothesis in genetic algorithms -- A superior evolutionary algorithm for 3-SAT -- Evolvable hardware control for dynamic reconfigurable and adaptive computing -- Evolutionary programming strategies with self-adaptation applied to the design of rotorcraft using parallel processing -- Optimization of thinned phased arrays using evolutionary programming -- Evolutionary domain covering of an inference system for function approximation -- Learning to re-engineer semantic networks using cultural algorithms -- Integration of slicing methods into a Cultural Algorithm in order to assist in large-scale engineering systems design -- Genetic search for object identification -- Fuzzy cultural algorithms with evolutionary programming -- Culturing evolution strategies to support the exploration of novel environments by an intelligent robotic agent -- Skeuomorphs and cultural algorithms -- Sphere operators and their applicability for constrained parameter optimization problems -- Numeric mutation as an improvement to symbolic regression in genetic programming -- Variable-dimensional optimization with evolutionary algorithms using fixed-length representations -- On making problems evolutionarily friendly part 1: Evolving the most convenient representations -- On making problems evolutionarily friendly part 2: Evolving the most convenient coordinate systems within which to pose (and solve) the given problem -- An experimental investigation of self-adaptation in evolutionary programming -- On the application of evolutionary pattern search algorithms -- The schema theorem and the misallocation of trials in the presence of stochastic effects -- On the “Explorative power” of ES/EP-like algorithms -- Resampling and its avoidance in genetic algorithms -- Evolutionary search for minimal elements in partially ordered finite sets -- Tailoring mutation to landscape properties -- A genetic programming methodology for missile countermeasures optimization under uncertainty -- Evolutionary algorithms for vertex cover -- An evolutionary self-learning methodology: Some preliminary results from a case study -- Evolving IIR filters in multipath environments -- Fuzzy partition and input selection by genetic algorithms for designing fuzzy rule-based classification systems -- Evolving nonlinear controllers for backing up a truck-and-trailer using evolutionary programming -- Reconstruction of DNA sequence information from a simulated DNA chip using evolutionary programming -- Using programmatic motifs and genetic programming to classify protein sequences as to cellular location -- Fully automated and rapid flexible docking of inhibitors covalently bound to serine proteases -- Microtubule networks as a medium for adaptive information processing -- Evolve IV: A metabolically-based artificial ecosystem model -- Sex, mate selection, and evolution -- Finding low energy conformations of atomic clusters using evolution strategies -- Estimating the distribution of neural connections in the saccadic system using a biologically plausible learning rule — Preliminary results -- Evolutionary algorithms combined with deterministic search -- Steady state memetic algorithm for partial shape matching -- A fully characterized test suite for genetic programming -- Genetic algorithms for belief network inference: The role of scaling and niching -- Building software frameworks for evolutionary computation -- Recorded step directional mutation for faster convergence -- The behavior of particles -- Parameter selection in particle swarm optimization -- Evolutionary optimization versus particle swarm optimization: Philosophy and performance differences -- Comparison between genetic algorithms and particle swarm optimization -- A hybrid evolutionary learning system for synthesizing neural network pattern recognition systems -- An evolutionary algorithm for designing feedforward neural networks -- Dual network representation applied to the evolution of neural controllers -- What does the landscape of a Hopfield associative memory look like? -- Visualization of evolutionary adaptation in R n -- On the application of cohort-driven operators to continuous optimization problems using evolutionary computation -- Random search versus genetic programming as engines for collective adaptation -- Optimal mutation and crossover rates for a genetic algorithm operating in a dynamic environment -- Local selection -- Asymmetric mutations for stochastic search -- Automated rule extraction for engine health monitoring -- Genetic programming for automatic target classification and recognition in synthetic aperture radar imagery -- Evolving heuristics for planning -- Solving cutting stock problems by evolutionary programming -- An empirical investigation of an evolutionary algorithm's ability to maintain a known good solution -- Evolving integrated low-level behaviors into intelligently interactive simulated forces -- Using offset invariant crossover as a tool for discovering cycle lengths of a periodic function -- Evolving a generalised behaviour: Artificial ant problem revisited -- Co-evolving functions in genetic programming: Dynamic ADF creation using GliB -- Evolving spatially-localized projection filters for SAR automatic target recognition -- Genetic programming in the overlapping generations model: An illustration with the dynamics of the inflation rate. |
| Record Nr. | UNISA-996466357203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Evolutionary Programming VII [[electronic resource] ] : 7th International Conference, EP98, San Diego, California, USA, March 25–27, 1998 Proceedings / / edited by V.W. Porto, N. Saravanan, D. Waagen, A.E. Eiben
| Evolutionary Programming VII [[electronic resource] ] : 7th International Conference, EP98, San Diego, California, USA, March 25–27, 1998 Proceedings / / edited by V.W. Porto, N. Saravanan, D. Waagen, A.E. Eiben |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (XVI, 840 p.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer programming Microprocessors Artificial intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Programming Techniques Processor Architectures Artificial Intelligence |
| ISBN | 3-540-68515-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The cumulative consensus of cognitive agents in scenarios: A framework for evolutionary processes in semantic memory -- Preferential partner selection in evolutionary labor markets: A study in agent-based computational economics -- Subspace pursuit for exploratory modeling -- Complete classes of strategies for the Classical Iterated Prisoner's Dilemma -- Evolutionary computing in multi-agent environments: Operators -- Evaluation of a simple host-parasite genetic algorithm -- Testing three paradigms for evolving groups of cooperative, simple agents -- Acquisition of general adaptive features by evolution -- Hybrid interior-lagrangian penalty based evolutionary optimization -- GA-Optimal fitness functions -- Scaling up evolutionary programming algorithms -- Short notes on the schema theorem and the building block hypothesis in genetic algorithms -- A superior evolutionary algorithm for 3-SAT -- Evolvable hardware control for dynamic reconfigurable and adaptive computing -- Evolutionary programming strategies with self-adaptation applied to the design of rotorcraft using parallel processing -- Optimization of thinned phased arrays using evolutionary programming -- Evolutionary domain covering of an inference system for function approximation -- Learning to re-engineer semantic networks using cultural algorithms -- Integration of slicing methods into a Cultural Algorithm in order to assist in large-scale engineering systems design -- Genetic search for object identification -- Fuzzy cultural algorithms with evolutionary programming -- Culturing evolution strategies to support the exploration of novel environments by an intelligent robotic agent -- Skeuomorphs and cultural algorithms -- Sphere operators and their applicability for constrained parameter optimization problems -- Numeric mutation as an improvement to symbolic regression in genetic programming -- Variable-dimensional optimization with evolutionary algorithms using fixed-length representations -- On making problems evolutionarily friendly part 1: Evolving the most convenient representations -- On making problems evolutionarily friendly part 2: Evolving the most convenient coordinate systems within which to pose (and solve) the given problem -- An experimental investigation of self-adaptation in evolutionary programming -- On the application of evolutionary pattern search algorithms -- The schema theorem and the misallocation of trials in the presence of stochastic effects -- On the “Explorative power” of ES/EP-like algorithms -- Resampling and its avoidance in genetic algorithms -- Evolutionary search for minimal elements in partially ordered finite sets -- Tailoring mutation to landscape properties -- A genetic programming methodology for missile countermeasures optimization under uncertainty -- Evolutionary algorithms for vertex cover -- An evolutionary self-learning methodology: Some preliminary results from a case study -- Evolving IIR filters in multipath environments -- Fuzzy partition and input selection by genetic algorithms for designing fuzzy rule-based classification systems -- Evolving nonlinear controllers for backing up a truck-and-trailer using evolutionary programming -- Reconstruction of DNA sequence information from a simulated DNA chip using evolutionary programming -- Using programmatic motifs and genetic programming to classify protein sequences as to cellular location -- Fully automated and rapid flexible docking of inhibitors covalently bound to serine proteases -- Microtubule networks as a medium for adaptive information processing -- Evolve IV: A metabolically-based artificial ecosystem model -- Sex, mate selection, and evolution -- Finding low energy conformations of atomic clusters using evolution strategies -- Estimating the distribution of neural connections in the saccadic system using a biologically plausible learning rule — Preliminary results -- Evolutionary algorithms combined with deterministic search -- Steady state memetic algorithm for partial shape matching -- A fully characterized test suite for genetic programming -- Genetic algorithms for belief network inference: The role of scaling and niching -- Building software frameworks for evolutionary computation -- Recorded step directional mutation for faster convergence -- The behavior of particles -- Parameter selection in particle swarm optimization -- Evolutionary optimization versus particle swarm optimization: Philosophy and performance differences -- Comparison between genetic algorithms and particle swarm optimization -- A hybrid evolutionary learning system for synthesizing neural network pattern recognition systems -- An evolutionary algorithm for designing feedforward neural networks -- Dual network representation applied to the evolution of neural controllers -- What does the landscape of a Hopfield associative memory look like? -- Visualization of evolutionary adaptation in R n -- On the application of cohort-driven operators to continuous optimization problems using evolutionary computation -- Random search versus genetic programming as engines for collective adaptation -- Optimal mutation and crossover rates for a genetic algorithm operating in a dynamic environment -- Local selection -- Asymmetric mutations for stochastic search -- Automated rule extraction for engine health monitoring -- Genetic programming for automatic target classification and recognition in synthetic aperture radar imagery -- Evolving heuristics for planning -- Solving cutting stock problems by evolutionary programming -- An empirical investigation of an evolutionary algorithm's ability to maintain a known good solution -- Evolving integrated low-level behaviors into intelligently interactive simulated forces -- Using offset invariant crossover as a tool for discovering cycle lengths of a periodic function -- Evolving a generalised behaviour: Artificial ant problem revisited -- Co-evolving functions in genetic programming: Dynamic ADF creation using GliB -- Evolving spatially-localized projection filters for SAR automatic target recognition -- Genetic programming in the overlapping generations model: An illustration with the dynamics of the inflation rate. |
| Record Nr. | UNINA-9910144906003321 |
| 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
| 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 | ||
| ||
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
| 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
Computer architecture 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 | ||
| ||