Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics [electronic resource] :International Workshop, SLS 2007, Brussels, Belgium, September 6-8, 2007. Proceedings / edited by Thomas Stützle, Mauro Birattari, Holger H. Hoos.
by Stützle, Thomas [editor.]; Birattari, Mauro [editor.]; H. Hoos, Holger [editor.]; SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 4638Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.Description: X, 223 p. online resource.ISBN: 9783540744467.Subject(s): Computer science | Data structures (Computer science) | Computer software | Data mining | Information storage and retrieval systems | Computer Science | Data Structures | Data Storage Representation | Algorithm Analysis and Problem Complexity | Probability and Statistics in Computer Science | Data Mining and Knowledge Discovery | Information Storage and RetrievalDDC 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 Introduction to Cryptography | QA76.9.D35 New Stream Cipher Designs | QA76.9.D35 Heterogeneous Objects Modelling and Applications | QA76.9.D35 Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics | QA76.9.D35 Spatial Information Theory | QA76.9.D35 Operational Semantics and Verification of Security Protocols | QA76.9.D35 Graph Transformations |
The Importance of Being Careful -- The Importance of Being Careful -- Designing and Tuning SLS Through Animation and Graphics: An Extended Walk-Through -- Implementation Effort and Performance -- Tuning the Performance of the MMAS Heuristic -- Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions -- EasyAnalyzer: An Object-Oriented Framework for the Experimental Analysis of Stochastic Local Search Algorithms -- Mixed Models for the Analysis of Local Search Components -- An Algorithm Portfolio for the Sub-graph Isomorphism Problem -- A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem -- A Practical Solution Using Simulated Annealing for General Routing Problems with Nodes, Edges, and Arcs -- Probabilistic Beam Search for the Longest Common Subsequence Problem -- A Bidirectional Greedy Heuristic for the Subspace Selection Problem -- Short Papers -- EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms -- Human-Guided Enhancement of a Stochastic Local Search: Visualization and Adjustment of 3D Pheromone -- Solving a Bi-objective Vehicle Routing Problem by Pareto-Ant Colony Optimization -- A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route -- A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem -- Local Search in Complex Scheduling Problems -- A Multi-sphere Scheme for 2D and 3D Packing Problems -- Formulation Space Search for Circle Packing Problems -- Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming.
This book constitutes the refereed proceedings of the International Workshop on Engineering Stochastic Local Search Algorithms 2007, held in Brussels, Belgium, September 6-8, 2007. The 12 revised full papers presented together with 9 short papers were carefully reviewed and selected from more than 50 submissions. The topics include Methodological developments, behavior of SLS algorithms, search space analysis, algorithm performance, tuning procedures, AI/OR techniques and dynamic behaviour.
There are no comments for this item.