Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics [electronic resource] :Second International Workshop, SLS 2009, Brussels, Belgium, September 3-4, 2009. Proceedings / edited by Thomas Stützle, Mauro Birattari, Holger H. Hoos.
by Stützle, Thomas [editor.]; Birattari, Mauro [editor.]; Hoos, Holger H [editor.]; SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 5752Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.Description: online resource.ISBN: 9783642037511.Subject(s): Computer science | Data structures (Computer science) | Computer software | Logic design | Data mining | Computer Science | Data Structures | Data Structures, Cryptology and Information Theory | Data Storage Representation | Algorithm Analysis and Problem Complexity | Logics and Meanings of Programs | Data Mining and Knowledge DiscoveryDDC classification: 005.73 Online resources: Click here to access online | Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| MAIN LIBRARY | QA76.9.D35 (Browse shelf) | Available |
Browsing MAIN LIBRARY Shelves Close shelf browser
| QA76.9.D35 Graph Transformations | QA76.9.D35 Practical Signcryption | QA76.9.D35 The LLL Algorithm | QA76.9.D35 Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics | QA76.9.D35 Spatial Information Theory | QA76.9.D35 Global Security, Safety, and Sustainability | QA76.9.D35 Understanding Cryptography |
High-Performance Local Search for Task Scheduling with Human Resource Allocation -- High-Performance Local Search for Task Scheduling with Human Resource Allocation -- On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms -- Estimating Bounds on Expected Plateau Size in MAXSAT Problems -- A Theoretical Analysis of the k-Satisfiability Search Space -- Loopy Substructural Local Search for the Bayesian Optimization Algorithm -- Running Time Analysis of ACO Systems for Shortest Path Problems -- Techniques and Tools for Local Search Landscape Visualization and Analysis -- Short Papers -- High-Performance Local Search for Solving Real-Life Inventory Routing Problems -- A Detailed Analysis of Two Metaheuristics for the Team Orienteering Problem -- On the Explorative Behavior of MAX–MIN Ant System -- A Study on Dominance-Based Local Search Approaches for Multiobjective Combinatorial Optimization -- A Memetic Algorithm for the Multidimensional Assignment Problem -- Autonomous Control Approach for Local Search -- EasyGenetic: A Template Metaprogramming Framework for Genetic Master-Slave Algorithms -- Adaptive Operator Selection for Iterated Local Search -- Improved Robustness through Population Variance in Ant Colony Optimization -- Mixed-Effects Modeling of Optimisation Algorithm Performance.
This book constitutes the refereed proceedings of the International Workshop on Engineering Stochastic Local Search Algorithms 2009, held in Brussels, Belgium, September 3-5, 2009. The 7 revised full papers presented together with 10 short papers were carefully reviewed and selected from more than 27 submissions. The topics include e. g. the use of run time distributions to evaluate and compare, high- performance local search for task scheduling with human, running time analysis of ACO Systems for shortest path problems, the explorative behavior of MAX-MIN ant system and improved robustness through population variance and colony optimization.
There are no comments for this item.