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 Computation in Combinatorial Optimization [[electronic resource] ] : 18th European Conference, EvoCOP 2018, Parma, Italy, April 4–6, 2018, Proceedings / / edited by Arnaud Liefooghe, Manuel López-Ibáñez
| Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 18th European Conference, EvoCOP 2018, Parma, Italy, April 4–6, 2018, Proceedings / / edited by Arnaud Liefooghe, Manuel López-Ibáñez |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XIV, 189 p. 31 illus.) |
| Disciplina | 005.432 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Algorithms Artificial intelligence Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Numerical Analysis Artificial Intelligence Discrete Mathematics in Computer Science Data Science |
| ISBN | 3-319-77449-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Better Runtime Guarantees via Stochastic Domination -- 1 Introduction -- 2 Stochastic Domination -- 3 Domination-Based Fitness Level Method -- 4 Beyond the Fitness Level Theorem -- 5 Structural Domination -- 6 Conclusion -- References -- On the Fractal Nature of Local Optima Networks -- 1 Introduction -- 2 Background -- 2.1 The Study of Fitness Landscapes -- 2.2 The Local Optima Network -- 2.3 The Fractal Dimension -- 2.4 Fractals and Fitness Landscapes -- 2.5 Fractals and Complex Networks -- 3 Experimental Setting -- 3.1 Test Problem -- 3.2 Metaheuristics -- 3.3 Fractal Analysis -- 4 Results -- 4.1 Fractals and Epistasis -- 4.2 Fractal Dimension and Search Performance -- 5 Discussion -- 5.1 The Fractal Shape of Local Optima Networks -- 5.2 Connections with Search Difficulty -- 6 Conclusions and Future Work -- References -- How Perturbation Strength Shapes the Global Structure of TSP Fitness Landscapes -- 1 Introduction -- 2 Definitions and Algorithms -- 3 Empirical Methodology -- 3.1 Instances -- 3.2 Sampling Method -- 3.3 Performance and Network Metrics -- 4 Results and Analysis -- 4.1 Visualisation -- 4.2 Performance and Network Metrics Results -- 4.3 Impact of Perturbation Strength on Success Rate -- 4.4 Correlation Analysis -- 4.5 Correlation Variance Between Instance Classes -- 5 Conclusions -- References -- Worst Improvement Based Iterated Local Search -- 1 Introduction -- 2 Definitions -- 2.1 Fitness Landscapes and Related Concepts -- 2.2 Bit-String Landscapes Instances -- 3 Worst Improvement Hill-Climbing -- 3.1 Pivoting Rules -- 3.2 Additional Experiments -- 4 Experimental Analysis -- 4.1 Experimental Protocol -- 4.2 Results -- 4.3 ILS Performance and Landscape Features -- 5 Conclusion -- References.
Automatic Grammar-Based Design of Heuristic Algorithms for Unconstrained Binary Quadratic Programming -- 1 Introduction -- 2 Related Work -- 3 Proposed Approach -- 3.1 Grammar and the Heuristic Search Space -- 3.2 Automatic Design Using irace -- 4 Experiments and Results -- 4.1 Tuning with a Single Instance Set -- 4.2 Tuning with a Random Instance Set -- 5 Conclusions -- References -- Automatic Algorithm Configuration for the Permutation Flow Shop Scheduling Problem Minimizing Total Completion Time -- 1 Introduction -- 2 Automatic Algorithm Configuration -- 2.1 Grammar and Components -- 2.2 Solution Representation -- 2.3 Search Strategy -- 3 Computational Experiments -- 3.1 Benchmarks -- 3.2 Experimental Setup -- 3.3 Results -- 4 Conclusions -- References -- Data Clustering Using Grouping Hyper-heuristics -- 1 Introduction -- 2 Related Work -- 2.1 Solution Representation in Grouping Problems -- 2.2 Data Clustering -- 3 A Grouping Hyper-heuristic Approach to Solve Grouping Problems -- 3.1 Low Level Heuristics -- 3.2 Selection Hyper-heuristic Components -- 4 Application of Grouping Hyper-heuristics to Data Clustering -- 4.1 Experimental Data -- 4.2 Trials and Parameters Settings and CPU Specifications -- 4.3 Evaluation Criteria -- 4.4 Experimental Results and Remarks -- 5 Conclusion -- References -- Reference Point Adaption Method -1for Genetic Programming Hyper-Heuristic in Many-Objective Job Shop Scheduling -- 1 Introduction -- 2 Background -- 2.1 Problem Description of JSS -- 2.2 Related Work -- 3 Adaptive Reference Points for Many-Objective JSS -- 3.1 Fitness Evaluation -- 3.2 Reference Point Generation -- 4 Experiment Design -- 4.1 Parameter Settings -- 4.2 Data Set -- 4.3 Performance Measures -- 5 Results and Discussions -- 5.1 Overall Result -- 6 Conclusion -- References. MOEA/DEP: An Algebraic Decomposition-Based Evolutionary Algorithm for the Multiobjective Permutation Flowshop Scheduling Problem -- 1 Introduction and Related Work -- 2 Multiobjective Optimization and MOEA/D Framework -- 3 Algebraic Differential Evolution for Permutations -- 4 MOEA/DEP -- 4.1 Initialization -- 4.2 Offsprings Generation -- 4.3 Population Update -- 4.4 Crossover for Permutations -- 5 Experiments -- 5.1 Parameters Calibration -- 5.2 Comparison with MEDA/D-MK -- 6 Conclusion and Future Work -- References -- An Evolutionary Algorithm with Practitioner's-Knowledge-Based Operators for the Inventory Routing Problem -- 1 Introduction -- 2 Problem Definition -- 3 Evolutionary Approach -- 3.1 Search Space and Solution Encoding -- 3.2 Initial Population -- 3.3 Recombination Operator -- 3.4 Date-Changing Mutation (DM) -- 3.5 Order-Changing Mutation (OM) -- 4 Experiments -- 5 Conclusions -- References -- A Multistart Alternating Tabu Search for Commercial Districting -- 1 Introduction -- 2 Definitions -- 3 Proposed Methods -- 3.1 Solution Construction -- 3.2 Optimizing Balance -- 3.3 Optimizing Compactness -- 3.4 Data Structures for Efficient Operations -- 4 Computational Experiments -- 4.1 Test Instances -- 4.2 Experimental Setup -- 4.3 Experiment 1: Constructive Algorithm -- 4.4 Experiment 2: Search Strategies -- 4.5 Experiment 3: Comparison with Existing Methods -- 5 Concluding Remarks -- References -- An Ant Colony Approach for the Winner Determination Problem -- 1 Introduction -- 1.1 Main Contributions -- 2 Winner Determination Problem -- 3 Literature Review -- 3.1 Exact Methods -- 3.2 Inexact Methods -- 4 Proposed Approach -- 4.1 Preprocessing Phase -- 4.2 Theoretical Convergence to Optimal for WDP -- 5 Randomized Pheromone Updating -- 5.1 Min-Max Pheromone Level -- 6 Randomized Graph Pruning -- 7 Experimental Results. 8 Conclusion and Future Research -- References -- Erratum to: On the Fractal Nature of Local Optima Networks -- Erratum to: Chapter "On the Fractal Nature of Local Optima Networks" in: A. Liefooghe and M. López-Ibáñez (Eds.): Evolutionary Computation in Combinatorial Optimization, LNCS 10782, https://doi.org/10.1007/978-3-319-77449-7_2 -- Author Index. |
| Record Nr. | UNISA-996465748203316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 18th European Conference, EvoCOP 2018, Parma, Italy, April 4–6, 2018, Proceedings / / edited by Arnaud Liefooghe, Manuel López-Ibáñez
| Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 18th European Conference, EvoCOP 2018, Parma, Italy, April 4–6, 2018, Proceedings / / edited by Arnaud Liefooghe, Manuel López-Ibáñez |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XIV, 189 p. 31 illus.) |
| Disciplina | 005.432 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Algorithms Artificial intelligence Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Numerical Analysis Artificial Intelligence Discrete Mathematics in Computer Science Data Science |
| ISBN | 3-319-77449-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Better Runtime Guarantees via Stochastic Domination -- 1 Introduction -- 2 Stochastic Domination -- 3 Domination-Based Fitness Level Method -- 4 Beyond the Fitness Level Theorem -- 5 Structural Domination -- 6 Conclusion -- References -- On the Fractal Nature of Local Optima Networks -- 1 Introduction -- 2 Background -- 2.1 The Study of Fitness Landscapes -- 2.2 The Local Optima Network -- 2.3 The Fractal Dimension -- 2.4 Fractals and Fitness Landscapes -- 2.5 Fractals and Complex Networks -- 3 Experimental Setting -- 3.1 Test Problem -- 3.2 Metaheuristics -- 3.3 Fractal Analysis -- 4 Results -- 4.1 Fractals and Epistasis -- 4.2 Fractal Dimension and Search Performance -- 5 Discussion -- 5.1 The Fractal Shape of Local Optima Networks -- 5.2 Connections with Search Difficulty -- 6 Conclusions and Future Work -- References -- How Perturbation Strength Shapes the Global Structure of TSP Fitness Landscapes -- 1 Introduction -- 2 Definitions and Algorithms -- 3 Empirical Methodology -- 3.1 Instances -- 3.2 Sampling Method -- 3.3 Performance and Network Metrics -- 4 Results and Analysis -- 4.1 Visualisation -- 4.2 Performance and Network Metrics Results -- 4.3 Impact of Perturbation Strength on Success Rate -- 4.4 Correlation Analysis -- 4.5 Correlation Variance Between Instance Classes -- 5 Conclusions -- References -- Worst Improvement Based Iterated Local Search -- 1 Introduction -- 2 Definitions -- 2.1 Fitness Landscapes and Related Concepts -- 2.2 Bit-String Landscapes Instances -- 3 Worst Improvement Hill-Climbing -- 3.1 Pivoting Rules -- 3.2 Additional Experiments -- 4 Experimental Analysis -- 4.1 Experimental Protocol -- 4.2 Results -- 4.3 ILS Performance and Landscape Features -- 5 Conclusion -- References.
Automatic Grammar-Based Design of Heuristic Algorithms for Unconstrained Binary Quadratic Programming -- 1 Introduction -- 2 Related Work -- 3 Proposed Approach -- 3.1 Grammar and the Heuristic Search Space -- 3.2 Automatic Design Using irace -- 4 Experiments and Results -- 4.1 Tuning with a Single Instance Set -- 4.2 Tuning with a Random Instance Set -- 5 Conclusions -- References -- Automatic Algorithm Configuration for the Permutation Flow Shop Scheduling Problem Minimizing Total Completion Time -- 1 Introduction -- 2 Automatic Algorithm Configuration -- 2.1 Grammar and Components -- 2.2 Solution Representation -- 2.3 Search Strategy -- 3 Computational Experiments -- 3.1 Benchmarks -- 3.2 Experimental Setup -- 3.3 Results -- 4 Conclusions -- References -- Data Clustering Using Grouping Hyper-heuristics -- 1 Introduction -- 2 Related Work -- 2.1 Solution Representation in Grouping Problems -- 2.2 Data Clustering -- 3 A Grouping Hyper-heuristic Approach to Solve Grouping Problems -- 3.1 Low Level Heuristics -- 3.2 Selection Hyper-heuristic Components -- 4 Application of Grouping Hyper-heuristics to Data Clustering -- 4.1 Experimental Data -- 4.2 Trials and Parameters Settings and CPU Specifications -- 4.3 Evaluation Criteria -- 4.4 Experimental Results and Remarks -- 5 Conclusion -- References -- Reference Point Adaption Method -1for Genetic Programming Hyper-Heuristic in Many-Objective Job Shop Scheduling -- 1 Introduction -- 2 Background -- 2.1 Problem Description of JSS -- 2.2 Related Work -- 3 Adaptive Reference Points for Many-Objective JSS -- 3.1 Fitness Evaluation -- 3.2 Reference Point Generation -- 4 Experiment Design -- 4.1 Parameter Settings -- 4.2 Data Set -- 4.3 Performance Measures -- 5 Results and Discussions -- 5.1 Overall Result -- 6 Conclusion -- References. MOEA/DEP: An Algebraic Decomposition-Based Evolutionary Algorithm for the Multiobjective Permutation Flowshop Scheduling Problem -- 1 Introduction and Related Work -- 2 Multiobjective Optimization and MOEA/D Framework -- 3 Algebraic Differential Evolution for Permutations -- 4 MOEA/DEP -- 4.1 Initialization -- 4.2 Offsprings Generation -- 4.3 Population Update -- 4.4 Crossover for Permutations -- 5 Experiments -- 5.1 Parameters Calibration -- 5.2 Comparison with MEDA/D-MK -- 6 Conclusion and Future Work -- References -- An Evolutionary Algorithm with Practitioner's-Knowledge-Based Operators for the Inventory Routing Problem -- 1 Introduction -- 2 Problem Definition -- 3 Evolutionary Approach -- 3.1 Search Space and Solution Encoding -- 3.2 Initial Population -- 3.3 Recombination Operator -- 3.4 Date-Changing Mutation (DM) -- 3.5 Order-Changing Mutation (OM) -- 4 Experiments -- 5 Conclusions -- References -- A Multistart Alternating Tabu Search for Commercial Districting -- 1 Introduction -- 2 Definitions -- 3 Proposed Methods -- 3.1 Solution Construction -- 3.2 Optimizing Balance -- 3.3 Optimizing Compactness -- 3.4 Data Structures for Efficient Operations -- 4 Computational Experiments -- 4.1 Test Instances -- 4.2 Experimental Setup -- 4.3 Experiment 1: Constructive Algorithm -- 4.4 Experiment 2: Search Strategies -- 4.5 Experiment 3: Comparison with Existing Methods -- 5 Concluding Remarks -- References -- An Ant Colony Approach for the Winner Determination Problem -- 1 Introduction -- 1.1 Main Contributions -- 2 Winner Determination Problem -- 3 Literature Review -- 3.1 Exact Methods -- 3.2 Inexact Methods -- 4 Proposed Approach -- 4.1 Preprocessing Phase -- 4.2 Theoretical Convergence to Optimal for WDP -- 5 Randomized Pheromone Updating -- 5.1 Min-Max Pheromone Level -- 6 Randomized Graph Pruning -- 7 Experimental Results. 8 Conclusion and Future Research -- References -- Erratum to: On the Fractal Nature of Local Optima Networks -- Erratum to: Chapter "On the Fractal Nature of Local Optima Networks" in: A. Liefooghe and M. López-Ibáñez (Eds.): Evolutionary Computation in Combinatorial Optimization, LNCS 10782, https://doi.org/10.1007/978-3-319-77449-7_2 -- Author Index. |
| Record Nr. | UNINA-9910349457903321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings / / edited by Bin Hu, Manuel López-Ibáñez
| Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings / / edited by Bin Hu, Manuel López-Ibáñez |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XII, 249 p. 46 illus.) |
| Disciplina | 005.432 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Algorithms Computer science—Mathematics Discrete mathematics Computer science Artificial intelligence Numerical Analysis Discrete Mathematics in Computer Science Theory of Computation Artificial Intelligence |
| ISBN | 3-319-55453-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Computational Study of Neighborhood Operators for Job-shop Scheduling Problems with Regular Objectives -- A Genetic Algorithm for Multi-Component Optimization Problems: the Case of the Travelling Thief Problem -- A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search -- A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling -- Construct, Merge, Solve and Adapt versus Large Neighborhood Search for Solving the Multi-Dimensional Knapsack Problem: Which One Works Better When -- Decomposing SAT Instances with Pseudo Backbones -- Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control -- Estimation of Distribution Algorithms for the Firefighter Problem -- LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows -- Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO -- Optimizing Charging Station Locations for Electric Car-Sharing Systems -- Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier -- Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants -- The Weighted Independent Domination Problem: ILP Model and Algorithmic . |
| Record Nr. | UNISA-996466214603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings / / edited by Bin Hu, Manuel López-Ibáñez
| Evolutionary Computation in Combinatorial Optimization [[electronic resource] ] : 17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings / / edited by Bin Hu, Manuel López-Ibáñez |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XII, 249 p. 46 illus.) |
| Disciplina | 005.432 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Algorithms Computer science—Mathematics Discrete mathematics Computer science Artificial intelligence Numerical Analysis Discrete Mathematics in Computer Science Theory of Computation Artificial Intelligence |
| ISBN | 3-319-55453-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Computational Study of Neighborhood Operators for Job-shop Scheduling Problems with Regular Objectives -- A Genetic Algorithm for Multi-Component Optimization Problems: the Case of the Travelling Thief Problem -- A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search -- A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling -- Construct, Merge, Solve and Adapt versus Large Neighborhood Search for Solving the Multi-Dimensional Knapsack Problem: Which One Works Better When -- Decomposing SAT Instances with Pseudo Backbones -- Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control -- Estimation of Distribution Algorithms for the Firefighter Problem -- LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows -- Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO -- Optimizing Charging Station Locations for Electric Car-Sharing Systems -- Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier -- Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants -- The Weighted Independent Domination Problem: ILP Model and Algorithmic . |
| Record Nr. | UNINA-9910483329803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Parallel Problem Solving from Nature – PPSN XIV [[electronic resource] ] : 14th International Conference, Edinburgh, UK, September 17-21, 2016, Proceedings / / edited by Julia Handl, Emma Hart, Peter R. Lewis, Manuel López-Ibáñez, Gabriela Ochoa, Ben Paechter
| Parallel Problem Solving from Nature – PPSN XIV [[electronic resource] ] : 14th International Conference, Edinburgh, UK, September 17-21, 2016, Proceedings / / edited by Julia Handl, Emma Hart, Peter R. Lewis, Manuel López-Ibáñez, Gabriela Ochoa, Ben Paechter |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XXI, 1026 p. 273 illus.) |
| Disciplina | 004.35 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Bioinformatics Computer science Pattern recognition systems Algorithms Computer science—Mathematics Discrete mathematics Artificial Intelligence Computational and Systems Biology Theory of Computation Automated Pattern Recognition Discrete Mathematics in Computer Science |
| ISBN | 3-319-45823-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Adaption, self-adaption and parameter tuning -- Differential evolution and swarm intelligence -- Dynamic, uncertain and constrained environments -- Genetic programming -- Multi-objective, many-objective and multi-level optimization -- Parallel algorithms and hardware issues -- Real-word applications and modeling -- Theory -- Diversity and landscape analysis -- Workshops and Tutorials. |
| Record Nr. | UNISA-996465322703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Parallel Problem Solving from Nature – PPSN XIV [[electronic resource] ] : 14th International Conference, Edinburgh, UK, September 17-21, 2016, Proceedings / / edited by Julia Handl, Emma Hart, Peter R. Lewis, Manuel López-Ibáñez, Gabriela Ochoa, Ben Paechter
| Parallel Problem Solving from Nature – PPSN XIV [[electronic resource] ] : 14th International Conference, Edinburgh, UK, September 17-21, 2016, Proceedings / / edited by Julia Handl, Emma Hart, Peter R. Lewis, Manuel López-Ibáñez, Gabriela Ochoa, Ben Paechter |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XXI, 1026 p. 273 illus.) |
| Disciplina | 004.35 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Bioinformatics Computer science Pattern recognition systems Algorithms Computer science—Mathematics Discrete mathematics Artificial Intelligence Computational and Systems Biology Theory of Computation Automated Pattern Recognition Discrete Mathematics in Computer Science |
| ISBN | 3-319-45823-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Adaption, self-adaption and parameter tuning -- Differential evolution and swarm intelligence -- Dynamic, uncertain and constrained environments -- Genetic programming -- Multi-objective, many-objective and multi-level optimization -- Parallel algorithms and hardware issues -- Real-word applications and modeling -- Theory -- Diversity and landscape analysis -- Workshops and Tutorials. |
| Record Nr. | UNINA-9910484824603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Swarm Intelligence [[electronic resource] ] : 10th International Conference, ANTS 2016, Brussels, Belgium, September 7-9, 2016, Proceedings / / edited by Marco Dorigo, Mauro Birattari, Xiaodong Li, Manuel López-Ibáñez, Kazuhiro Ohkura, Carlo Pinciroli, Thomas Stützle
| Swarm Intelligence [[electronic resource] ] : 10th International Conference, ANTS 2016, Brussels, Belgium, September 7-9, 2016, Proceedings / / edited by Marco Dorigo, Mauro Birattari, Xiaodong Li, Manuel López-Ibáñez, Kazuhiro Ohkura, Carlo Pinciroli, Thomas Stützle |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XIII, 304 p. 105 illus.) |
| Disciplina | 006.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Algorithms Computer science Application software Information storage and retrieval systems Database management Artificial Intelligence Theory of Computation Computer and Information Systems Applications Information Storage and Retrieval Database Management |
| ISBN | 3-319-44427-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Bearing-only Pattern Formation Algorithm for Swarm Robotics -- A Macroscopic Privacy Model for Heterogeneous Robot Swarms -- A New Continuous Model for Segregation Implemented and Analyzed on Swarm Robots -- A Study of Archiving Strategies in Multi-objective PSO for Molecular Docking -- Ant Colony Optimisation-based Classification using Two-dimensional Polygons -- Collective Perception of Environmental Features in a Robot Swarm -- Communication Diversity in Particle Swarm Optimizers -- Continuous Time Gathering of Agents with Limited Visibility and Bearing-only Sensing -- Design and Analysis of Proximate Mechanisms for Cooperative Transport in Real Robots -- Dynamic Task Partitioning for Foraging Robot Swarms -- Human-robot Swarm Interaction with Limited Situational Awareness -- Monotonicity in Ant Colony Classification Algorithms -- Observing the Effects of Overdesign in the Automatic Design of Control Software for Robot Swarms -- Parameter Selection in Particle Swarm Optimisation from Stochastic Stability Analysis -- Population Coding: A New Design Paradigm for Embodied Distributed Systems -- Random Walks in Swarm Robotics: An Experiment with Kilobots -- Synthesizing Rulesets for Programmable Robotic Self-assembly: A Case Study using Floating Miniaturized Robots -- Using Ant Colony Optimization to Build Cluster-based Classification Systems -- A Swarm Intelligence Approach in Undersampling Majority Class -- Optimizing PolyACO Training with GPU-based Parallelization -- Motion Reconstruction of Swarm-like Self-organized Motor Bike Traffic from Public Videos -- On Heterogeneity in Foraging by Ant-like Colony: How Local Affects Global and Vice Versa -- On Stochastic Broadcast Control of Swarms -- Route Assignment for Autonomous Vehicles -- Stealing Items More Efficiently with Ants: A Swarm Intelligence Approach to the Travelling Thief Problem -- Achieving Synchronisation in Swarm Robotics: Applying Networked Q-Learning to Production Line Automata -- Autonomous Task Allocation for Swarm Robotic Systems Using Hierarchical Strategy -- Avoidance Strategies for Particle Swarm Optimisation in Power Generation Scheduling -- Clustering with the ACOR Algorithm -- Consideration Regarding the Reduction of Reality Gap in Evolutionary Swarm Robotics -- Hybrid Deployment Algorithm of Swarm Robots for Wireless Mesh Network -- On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations -- Particle Swarm Optimisation with Diversity Influenced Gradually Increasing Neighbourhoods. |
| Record Nr. | UNISA-996465656703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Swarm Intelligence [[electronic resource] ] : 10th International Conference, ANTS 2016, Brussels, Belgium, September 7-9, 2016, Proceedings / / edited by Marco Dorigo, Mauro Birattari, Xiaodong Li, Manuel López-Ibáñez, Kazuhiro Ohkura, Carlo Pinciroli, Thomas Stützle
| Swarm Intelligence [[electronic resource] ] : 10th International Conference, ANTS 2016, Brussels, Belgium, September 7-9, 2016, Proceedings / / edited by Marco Dorigo, Mauro Birattari, Xiaodong Li, Manuel López-Ibáñez, Kazuhiro Ohkura, Carlo Pinciroli, Thomas Stützle |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XIII, 304 p. 105 illus.) |
| Disciplina | 006.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence
Algorithms Computer science Application software Information storage and retrieval systems Database management Artificial Intelligence Theory of Computation Computer and Information Systems Applications Information Storage and Retrieval Database Management |
| ISBN | 3-319-44427-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Bearing-only Pattern Formation Algorithm for Swarm Robotics -- A Macroscopic Privacy Model for Heterogeneous Robot Swarms -- A New Continuous Model for Segregation Implemented and Analyzed on Swarm Robots -- A Study of Archiving Strategies in Multi-objective PSO for Molecular Docking -- Ant Colony Optimisation-based Classification using Two-dimensional Polygons -- Collective Perception of Environmental Features in a Robot Swarm -- Communication Diversity in Particle Swarm Optimizers -- Continuous Time Gathering of Agents with Limited Visibility and Bearing-only Sensing -- Design and Analysis of Proximate Mechanisms for Cooperative Transport in Real Robots -- Dynamic Task Partitioning for Foraging Robot Swarms -- Human-robot Swarm Interaction with Limited Situational Awareness -- Monotonicity in Ant Colony Classification Algorithms -- Observing the Effects of Overdesign in the Automatic Design of Control Software for Robot Swarms -- Parameter Selection in Particle Swarm Optimisation from Stochastic Stability Analysis -- Population Coding: A New Design Paradigm for Embodied Distributed Systems -- Random Walks in Swarm Robotics: An Experiment with Kilobots -- Synthesizing Rulesets for Programmable Robotic Self-assembly: A Case Study using Floating Miniaturized Robots -- Using Ant Colony Optimization to Build Cluster-based Classification Systems -- A Swarm Intelligence Approach in Undersampling Majority Class -- Optimizing PolyACO Training with GPU-based Parallelization -- Motion Reconstruction of Swarm-like Self-organized Motor Bike Traffic from Public Videos -- On Heterogeneity in Foraging by Ant-like Colony: How Local Affects Global and Vice Versa -- On Stochastic Broadcast Control of Swarms -- Route Assignment for Autonomous Vehicles -- Stealing Items More Efficiently with Ants: A Swarm Intelligence Approach to the Travelling Thief Problem -- Achieving Synchronisation in Swarm Robotics: Applying Networked Q-Learning to Production Line Automata -- Autonomous Task Allocation for Swarm Robotic Systems Using Hierarchical Strategy -- Avoidance Strategies for Particle Swarm Optimisation in Power Generation Scheduling -- Clustering with the ACOR Algorithm -- Consideration Regarding the Reduction of Reality Gap in Evolutionary Swarm Robotics -- Hybrid Deployment Algorithm of Swarm Robots for Wireless Mesh Network -- On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations -- Particle Swarm Optimisation with Diversity Influenced Gradually Increasing Neighbourhoods. |
| Record Nr. | UNINA-9910483898203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||