06523nam 22009255 450 99646563650331620231005153459.03-642-03751-810.1007/978-3-642-03751-1(CKB)1000000000784722(SSID)ssj0000317493(PQKBManifestationID)11253559(PQKBTitleCode)TC0000317493(PQKBWorkID)10294271(PQKB)10090895(DE-He213)978-3-642-03751-1(MiAaPQ)EBC3064536(PPN)139955097(EXLCZ)99100000000078472220100301d2009 u| 0engurnn#008mamaatxtccrEngineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics[electronic resource] International Workshop, SLS 2009, Brussels, Belgium, September 3-5, 2009, Proceedings /edited by Thomas Stützle, Mauro Birattari, Holger H. Hoos1st ed. 2009.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2009.1 online resource (X, 155 p.)Theoretical Computer Science and General Issues,2512-2029 ;5752Bibliographic Level Mode of Issuance: Monograph3-642-03750-X Includes bibliographical references and index.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.Stochastic local search (SLS) algorithms are established tools for the solution of computationally hard problems arising in computer science, business adm- istration, engineering, biology, and various other disciplines. To a large extent, their success is due to their conceptual simplicity, broad applicability and high performance for many important problems studied in academia and enco- tered in real-world applications. SLS methods include a wide spectrum of te- niques, ranging from constructive search procedures and iterative improvement algorithms to more complex SLS methods, such as ant colony optimization, evolutionary computation, iterated local search, memetic algorithms, simulated annealing, tabu search, and variable neighborhood search. Historically, the development of e?ective SLS algorithms has been guided to a large extent by experience and intuition. In recent years, it has become - creasingly evident that success with SLS algorithms depends not merely on the adoption and e?cient implementation of the most appropriate SLS technique for a given problem, but also on the mastery of a more complex algorithm - gineering process. Challenges in SLS algorithm development arise partly from the complexity of the problems being tackled and in part from the many - grees of freedom researchers and practitioners encounter when developing SLS algorithms. Crucial aspects in the SLS algorithm development comprise al- rithm design, empirical analysis techniques, problem-speci?c background, and background knowledge in several key disciplines and areas, including computer science, operations research, arti?cial intelligence, and statistics.Theoretical Computer Science and General Issues,2512-2029 ;5752Computer programmingArtificial intelligence—Data processingData structures (Computer science)Information theoryInformation retrievalComputer architectureAlgorithmsComputer scienceProgramming TechniquesData ScienceData Structures and Information TheoryData Storage RepresentationAlgorithmsComputer Science Logic and Foundations of ProgrammingRecursos electrònics en xarxathubCerca a InternetthubProgramació estocàsticathubCongressosthubLlibres electrònicsthubComputer programming.Artificial intelligence—Data processing.Data structures (Computer science).Information theory.Information retrieval.Computer architecture.Algorithms.Computer science.Programming Techniques.Data Science.Data Structures and Information Theory.Data Storage Representation.Algorithms.Computer Science Logic and Foundations of Programming.Recursos electrònics en xarxaCerca a InternetProgramació estocàstica005.11Stützle Thomasedthttp://id.loc.gov/vocabulary/relators/edtBirattari Mauroedthttp://id.loc.gov/vocabulary/relators/edtHoos Holger Hedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465636503316Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics772147UNISA01577nam0 22003493i 450 SBL027591020231121125819.0IT657847 20041012d1965 ||||0itac50 baitaitz01i xxxe z01nPrestito, espansione e migrazione dei termini tecnici nelle lingue romanze e non romanzeproblemi, metodo e risultatiB. E. VidosFirenzeL. S. Olschki1965VIII, 422 p.26 cm.Biblioteca dell'Archivum Romanicum. Serie 2, Linguistica31001CFI00412552001 Biblioteca dell'Archivum Romanicum. Serie 2, Linguistica31Termini tecniciTrasmissioneFIRRMLC254451I41321Vidos, Benedek ElemerMILV053041070450639Vidos, Benedictus EleutheriusMILV199708Vidos, Benedek ElemerVidos, Benedictus Maria Paulus EleutheriusMILV199709Vidos, Benedek ElemerITIT-0120041012IT-RM0290 IT-FR0017 BIBLIOTECA ANGELICARM0290 Biblioteca umanistica Giorgio ApreaFR0017 SBL0275910Biblioteca umanistica Giorgio Aprea 52MAG 8 Coll I-2Serie 31 52MAG0000017415 VMN RS A 2013052820130528 06 52Prestito, espansione e migrazione dei termini tecnici nelle lingue romanze e non romanze148275UNICAS