top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Ant Algorithms [[electronic resource] ] : Third International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002. Proceedings / / edited by Marco Dorigo, Gianni Di Caro, Michael Sampels
Ant Algorithms [[electronic resource] ] : Third International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002. Proceedings / / edited by Marco Dorigo, Gianni Di Caro, Michael Sampels
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (XIV, 310 p.)
Disciplina 512/.7
Collana Lecture Notes in Computer Science
Soggetto topico Computer communication systems
Artificial intelligence
Computer programming
Algorithms
Computers
Numerical analysis
Computer Communication Networks
Artificial Intelligence
Programming Techniques
Algorithm Analysis and Problem Complexity
Computation by Abstract Devices
Numeric Computing
ISBN 3-540-45724-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A MAX-MIN Ant System for the University Course Timetabling Problem -- A MAX-MIN Ant System for the University Course Timetabling Problem -- ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification -- ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification -- Agent-Based Approach to Dynamic Task Allocation -- Agent-Based Approach to Dynamic Task Allocation -- An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem -- An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem -- An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows -- An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows -- Ant Algorithms for Assembly Line Balancing -- Ant Algorithms for Assembly Line Balancing -- Ant Colonies as Logistic Processes Optimizers -- Ant Colonies as Logistic Processes Optimizers -- Ant Systems for a Dynamic TSP -- Ant Systems for a Dynamic TSP -- Anti-pheromone as a Tool for Better Exploration of Search Space -- Anti-pheromone as a Tool for Better Exploration of Search Space -- Applying Population Based ACO to Dynamic Optimization Problems -- Applying Population Based ACO to Dynamic Optimization Problems -- Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks -- Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks -- Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows -- Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows -- Modelling ACO: Composed Permutation Problems -- Modelling ACO: Composed Permutation Problems -- Self-Organized Networks of Galleries in the Ant Messor Sancta -- Self-Organized Networks of Galleries in the Ant Messor Sancta -- Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic -- Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic -- Toward the Formal Foundation of Ant Programming -- Toward the Formal Foundation of Ant Programming -- Towards Building Terrain-Covering Ant Robots -- Towards Building Terrain-Covering Ant Robots -- Short Papers -- A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions -- An Ant-Based Framework for Very Strongly Constrained Problems -- Analysis of the Best-Worst Ant System and Its Variants on the QAP -- Ants and Loops -- Candidate Set Strategies for Ant Colony Optimisation -- Dynamic Wavelength Routing in WDM Networks via Ant Colony Optimization -- Homogeneous Ants for Web Document Similarity Modeling and Categorization -- Parallel Ant System for the Set Covering Problem -- Real-World Shop Floor Scheduling by Ant Colony Optimization -- Simulation of Nest Assessment Behavior by Ant Scouts -- Using Genetic Algorithms to Optimize ACS-TSP -- Posters -- A Method for Solving Optimization Problems in Continuous Space Using Ant Colony Algorithm -- A Nested Layered Threshold Model for Dynamic Task Allocation -- ACO Algorithm with Additional Reinforcement -- Ant Colony System for Image Segmentation Using Markov Random Field -- Bidimensional Shapes Polygonalization by ACO -- Coevolutionary Ant Algorithms Playing Games -- GAACO: A GA + ACO Hybrid for Faster and Better Search Capability -- GPS Positioning Networks Design: An Application of the Ant Colony System.
Record Nr. UNINA-9910143893103321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Ant Algorithms [[electronic resource] ] : Third International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002. Proceedings / / edited by Marco Dorigo, Gianni Di Caro, Michael Sampels
Ant Algorithms [[electronic resource] ] : Third International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002. Proceedings / / edited by Marco Dorigo, Gianni Di Caro, Michael Sampels
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Descrizione fisica 1 online resource (XIV, 310 p.)
Disciplina 512/.7
Collana Lecture Notes in Computer Science
Soggetto topico Computer communication systems
Artificial intelligence
Computer programming
Algorithms
Computers
Numerical analysis
Computer Communication Networks
Artificial Intelligence
Programming Techniques
Algorithm Analysis and Problem Complexity
Computation by Abstract Devices
Numeric Computing
ISBN 3-540-45724-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A MAX-MIN Ant System for the University Course Timetabling Problem -- A MAX-MIN Ant System for the University Course Timetabling Problem -- ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification -- ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification -- Agent-Based Approach to Dynamic Task Allocation -- Agent-Based Approach to Dynamic Task Allocation -- An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem -- An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem -- An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows -- An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows -- Ant Algorithms for Assembly Line Balancing -- Ant Algorithms for Assembly Line Balancing -- Ant Colonies as Logistic Processes Optimizers -- Ant Colonies as Logistic Processes Optimizers -- Ant Systems for a Dynamic TSP -- Ant Systems for a Dynamic TSP -- Anti-pheromone as a Tool for Better Exploration of Search Space -- Anti-pheromone as a Tool for Better Exploration of Search Space -- Applying Population Based ACO to Dynamic Optimization Problems -- Applying Population Based ACO to Dynamic Optimization Problems -- Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks -- Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks -- Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows -- Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows -- Modelling ACO: Composed Permutation Problems -- Modelling ACO: Composed Permutation Problems -- Self-Organized Networks of Galleries in the Ant Messor Sancta -- Self-Organized Networks of Galleries in the Ant Messor Sancta -- Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic -- Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic -- Toward the Formal Foundation of Ant Programming -- Toward the Formal Foundation of Ant Programming -- Towards Building Terrain-Covering Ant Robots -- Towards Building Terrain-Covering Ant Robots -- Short Papers -- A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions -- An Ant-Based Framework for Very Strongly Constrained Problems -- Analysis of the Best-Worst Ant System and Its Variants on the QAP -- Ants and Loops -- Candidate Set Strategies for Ant Colony Optimisation -- Dynamic Wavelength Routing in WDM Networks via Ant Colony Optimization -- Homogeneous Ants for Web Document Similarity Modeling and Categorization -- Parallel Ant System for the Set Covering Problem -- Real-World Shop Floor Scheduling by Ant Colony Optimization -- Simulation of Nest Assessment Behavior by Ant Scouts -- Using Genetic Algorithms to Optimize ACS-TSP -- Posters -- A Method for Solving Optimization Problems in Continuous Space Using Ant Colony Algorithm -- A Nested Layered Threshold Model for Dynamic Task Allocation -- ACO Algorithm with Additional Reinforcement -- Ant Colony System for Image Segmentation Using Markov Random Field -- Bidimensional Shapes Polygonalization by ACO -- Coevolutionary Ant Algorithms Playing Games -- GAACO: A GA + ACO Hybrid for Faster and Better Search Capability -- GPS Positioning Networks Design: An Application of the Ant Colony System.
Record Nr. UNISA-996465516903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Hybrid Metaheuristics [[electronic resource] ] : 8th International Workshop, HM 2013, Ischia, Italy, May 23-25, 2013. Proceedings / / edited by Maria J. Blesa, Christian Blum, Paola Festa, Andrea Roli, Michael Sampels
Hybrid Metaheuristics [[electronic resource] ] : 8th International Workshop, HM 2013, Ischia, Italy, May 23-25, 2013. Proceedings / / edited by Maria J. Blesa, Christian Blum, Paola Festa, Andrea Roli, Michael Sampels
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (X, 213 p. 41 illus.)
Disciplina 006.3
Collana Theoretical Computer Science and General Issues
Soggetto topico Artificial intelligence
Numerical analysis
Algorithms
Computer science
Artificial Intelligence
Numerical Analysis
Theory of Computation
ISBN 3-642-38516-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996466288803316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Hybrid Metaheuristics [[electronic resource] ] : 8th International Workshop, HM 2013, Ischia, Italy, May 23-25, 2013. Proceedings / / edited by Maria J. Blesa, Christian Blum, Paola Festa, Andrea Roli, Michael Sampels
Hybrid Metaheuristics [[electronic resource] ] : 8th International Workshop, HM 2013, Ischia, Italy, May 23-25, 2013. Proceedings / / edited by Maria J. Blesa, Christian Blum, Paola Festa, Andrea Roli, Michael Sampels
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (X, 213 p. 41 illus.)
Disciplina 006.3
Collana Theoretical Computer Science and General Issues
Soggetto topico Artificial intelligence
Numerical analysis
Algorithms
Computer science
Artificial Intelligence
Numerical Analysis
Theory of Computation
ISBN 3-642-38516-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910483990403321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Hybrid Metaheuristics [[electronic resource] ] : 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010, Proceedings / / edited by Maria José Blesa, Christian Blum, Günther Raidl, Andrea Roli, Michael Sampels
Hybrid Metaheuristics [[electronic resource] ] : 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010, Proceedings / / edited by Maria José Blesa, Christian Blum, Günther Raidl, Andrea Roli, Michael Sampels
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica 1 online resource (X, 223 p. 43 illus.)
Disciplina 006.3
Collana Theoretical Computer Science and General Issues
Soggetto topico Software engineering
Compilers (Computer programs)
Algorithms
Computer science
Software Engineering
Compilers and Interpreters
Theory of Computation
Computer Science Logic and Foundations of Programming
ISBN 1-280-38941-9
9786613567338
3-642-16053-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A Hybrid Metaheuristic for the Longest Common Subsequence Problem -- Hybrid Algorithms for the Variable Sized Bin Packing Problem -- A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model -- A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem -- A New Approach for Solving the Generalized Traveling Salesman Problem -- Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem -- A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem -- A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents -- New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem -- An Improved Memetic Algorithm for Break Scheduling -- Consultant-Guided Search Algorithms for the Quadratic Assignment Problem -- On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard Feasibility Checks: An Application to the 2-Dimensional Loading Vehicle Routing Problem -- Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem -- SearchCol: Metaheuristic Search by Column Generation -- Survey: Matheuristics for Rich Vehicle Routing Problems.
Record Nr. UNISA-996465669503316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Hybrid Metaheuristics [[electronic resource] ] : 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010, Proceedings / / edited by Maria José Blesa, Christian Blum, Günther Raidl, Andrea Roli, Michael Sampels
Hybrid Metaheuristics [[electronic resource] ] : 7th International Workshop, HM 2010, Vienna, Austria, October 1-2, 2010, Proceedings / / edited by Maria José Blesa, Christian Blum, Günther Raidl, Andrea Roli, Michael Sampels
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica 1 online resource (X, 223 p. 43 illus.)
Disciplina 006.3
Collana Theoretical Computer Science and General Issues
Soggetto topico Software engineering
Compilers (Computer programs)
Algorithms
Computer science
Software Engineering
Compilers and Interpreters
Theory of Computation
Computer Science Logic and Foundations of Programming
ISBN 1-280-38941-9
9786613567338
3-642-16053-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A Hybrid Metaheuristic for the Longest Common Subsequence Problem -- Hybrid Algorithms for the Variable Sized Bin Packing Problem -- A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model -- A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem -- A New Approach for Solving the Generalized Traveling Salesman Problem -- Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem -- A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem -- A Memetic Algorithm for Reconstructing Cross-Cut Shredded Text Documents -- New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem -- An Improved Memetic Algorithm for Break Scheduling -- Consultant-Guided Search Algorithms for the Quadratic Assignment Problem -- On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard Feasibility Checks: An Application to the 2-Dimensional Loading Vehicle Routing Problem -- Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem -- SearchCol: Metaheuristic Search by Column Generation -- Survey: Matheuristics for Rich Vehicle Routing Problems.
Record Nr. UNINA-9910483139203321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Hybrid Metaheuristics [[electronic resource] ] : 6th International Workshop, HM 2009 Udine, Italy, October 16-17, 2009 Proceedings / / edited by Christian Blum, Luca Gaspero, Andrea Roli, Michael Sampels, Andrea Schaerf
Hybrid Metaheuristics [[electronic resource] ] : 6th International Workshop, HM 2009 Udine, Italy, October 16-17, 2009 Proceedings / / edited by Christian Blum, Luca Gaspero, Andrea Roli, Michael Sampels, Andrea Schaerf
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica 1 online resource (X, 179 p.)
Disciplina 006.312
Collana Theoretical Computer Science and General Issues
Soggetto topico Data mining
Algorithms
Information storage and retrieval systems
Computer science—Mathematics
Mathematical statistics
Computer science
Data Mining and Knowledge Discovery
Information Storage and Retrieval
Probability and Statistics in Computer Science
Theory of Computation
ISBN 3-642-04918-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem -- An ELSxPath Relinking Hybrid for the Periodic Location-Routing Problem -- Hybridizing Beam-ACO with Constraint Programming for Single Machine Job Scheduling -- Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows -- A Hybridization of Electromagnetic-Like Mechanism and Great Deluge for Examination Timetabling Problems -- Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem -- Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search -- Effective Hybrid Stochastic Local Search Algorithms for Biobjective Permutation Flowshop Scheduling -- Hierarchical Iterated Local Search for the Quadratic Assignment Problem -- Incorporating Tabu Search Principles into ACO Algorithms -- A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal ?+?+? -- Multi-neighborhood Local Search for the Patient Admission Problem -- Matheuristics: Optimization, Simulation and Control.
Record Nr. UNISA-996465845503316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Hybrid Metaheuristics [[electronic resource] ] : 6th International Workshop, HM 2009 Udine, Italy, October 16-17, 2009 Proceedings / / edited by Christian Blum, Luca Gaspero, Andrea Roli, Michael Sampels, Andrea Schaerf
Hybrid Metaheuristics [[electronic resource] ] : 6th International Workshop, HM 2009 Udine, Italy, October 16-17, 2009 Proceedings / / edited by Christian Blum, Luca Gaspero, Andrea Roli, Michael Sampels, Andrea Schaerf
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica 1 online resource (X, 179 p.)
Disciplina 006.312
Collana Theoretical Computer Science and General Issues
Soggetto topico Data mining
Algorithms
Information storage and retrieval systems
Computer science—Mathematics
Mathematical statistics
Computer science
Data Mining and Knowledge Discovery
Information Storage and Retrieval
Probability and Statistics in Computer Science
Theory of Computation
ISBN 3-642-04918-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem -- An ELSxPath Relinking Hybrid for the Periodic Location-Routing Problem -- Hybridizing Beam-ACO with Constraint Programming for Single Machine Job Scheduling -- Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows -- A Hybridization of Electromagnetic-Like Mechanism and Great Deluge for Examination Timetabling Problems -- Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem -- Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search -- Effective Hybrid Stochastic Local Search Algorithms for Biobjective Permutation Flowshop Scheduling -- Hierarchical Iterated Local Search for the Quadratic Assignment Problem -- Incorporating Tabu Search Principles into ACO Algorithms -- A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal ?+?+? -- Multi-neighborhood Local Search for the Patient Admission Problem -- Matheuristics: Optimization, Simulation and Control.
Record Nr. UNINA-9910484293603321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Hybrid Metaheuristics [[electronic resource] ] : 4th International Workshop,HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings / / edited by Thomas Bartz-Beielstein, Maria J. Blesa, Christian Blum, Boris Naujoks, Andrea Roli, Günther Rudolph, Michael Sampels
Hybrid Metaheuristics [[electronic resource] ] : 4th International Workshop,HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings / / edited by Thomas Bartz-Beielstein, Maria J. Blesa, Christian Blum, Boris Naujoks, Andrea Roli, Günther Rudolph, Michael Sampels
Edizione [1st ed. 2007.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Descrizione fisica 1 online resource (X, 201 p.)
Disciplina 006.3
Collana Theoretical Computer Science and General Issues
Soggetto topico Artificial intelligence
Algorithms
Computer science
Numerical analysis
Pattern recognition systems
Artificial Intelligence
Theory of Computation
Numerical Analysis
Automated Pattern Recognition
ISBN 3-540-75514-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Evolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem -- An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem -- Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems -- Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP -- Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem -- Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop -- A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy -- On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case -- Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement -- Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge -- Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric -- A Hybrid VNS for Connected Facility Location -- A Memetic Algorithm for the Optimum Communication Spanning Tree Problem -- Hybrid Numerical Optimization for Combinatorial Network Problems.
Record Nr. UNISA-996465976903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Hybrid Metaheuristics [[electronic resource] ] : 4th International Workshop,HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings / / edited by Thomas Bartz-Beielstein, Maria J. Blesa, Christian Blum, Boris Naujoks, Andrea Roli, Günther Rudolph, Michael Sampels
Hybrid Metaheuristics [[electronic resource] ] : 4th International Workshop,HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings / / edited by Thomas Bartz-Beielstein, Maria J. Blesa, Christian Blum, Boris Naujoks, Andrea Roli, Günther Rudolph, Michael Sampels
Edizione [1st ed. 2007.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Descrizione fisica 1 online resource (X, 201 p.)
Disciplina 006.3
Collana Theoretical Computer Science and General Issues
Soggetto topico Artificial intelligence
Algorithms
Computer science
Numerical analysis
Pattern recognition systems
Artificial Intelligence
Theory of Computation
Numerical Analysis
Automated Pattern Recognition
ISBN 3-540-75514-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Evolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem -- An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem -- Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems -- Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP -- Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem -- Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop -- A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy -- On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case -- Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement -- Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge -- Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric -- A Hybrid VNS for Connected Facility Location -- A Memetic Algorithm for the Optimum Communication Spanning Tree Problem -- Hybrid Numerical Optimization for Combinatorial Network Problems.
Record Nr. UNINA-9910484172003321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui