default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6th LION 2012: Paris, France
- Youssef Hamadi, Marc Schoenauer:
Learning and Intelligent Optimization - 6th International Conference, LION 6, Paris, France, January 16-20, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7219, Springer 2012, ISBN 978-3-642-34412-1
Long Papers
- Ethan Burns, Wheeler Ruml
:
Iterative-Deepening Search with On-Line Tree Size Prediction. 1-15 - Gilles Caporossi, Pierre Hansen:
A Learning Optimization Algorithm in Graph Theory - Versatile Search for Extremal Graphs Using a Learning Algorithm. 16-30 - Marco Caserta, Stefan Voß:
A Math-Heuristic Dantzig-Wolfe Algorithm for the Capacitated Lot Sizing Problem. 31-41 - Tristan Cazenave, Fabien Teytaud:
Application of the Nested Rollout Policy Adaptation Algorithm to the Traveling Salesman Problem with Time Windows. 42-54 - Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown:
Parallel Algorithm Configuration. 55-70 - Guanbo Jia, Zixing Cai, Mirco Musolesi, Yong Wang, Dan A. Tennant, Ralf J. M. Weber, John K. Heath, Shan He:
Community Detection in Social and Biological Networks Using Differential Evolution. 71-85 - Naoya Kowatari, Akira Oyama, Hernán E. Aguirre, Kiyoshi Tanaka:
A Study on Large Population MOEA Using Adaptive ε-Box Dominance and Neighborhood Recombination for Many-Objective Optimization. 86-100 - Franco Mascia, Thomas Stützle:
A Non-adaptive Stochastic Local Search Algorithm for the CHeSC 2011 Competition. 101-114 - Olaf Mersmann, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner, Frank Neumann:
Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. 115-129 - Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. 130-144 - Mike Preuss, Tobias Wagner, David Ginsbourger:
High-Dimensional Model-Based Optimization Based on Noisy Evaluations of Computer Games. 145-159 - Thomas Philip Runarsson, Marc Schoenauer, Michèle Sebag:
Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop Scheduling. 160-174 - Francesco Sambo, Barbara Di Camillo:
Minimizing Time When Applying Bootstrap to Contingency Tables Analysis of Genome-Wide Data. 175-189 - Marius Schneider, Holger H. Hoos:
Quantifying Homogeneity of Instance Sets for Algorithm Configuration. 190-204 - James Styles, Holger H. Hoos, Martin Müller:
Automatically Configuring Algorithms for Scaling Performance. 205-219 - Michèle Sebag, Olivier Teytaud:
Upper Confidence Tree-Based Consistent Reactive Planning Application to MineSweeper. 220-234 - Tamara Ulrich, Lothar Thiele:
Bounding the Effectiveness of Hypervolume-Based (μ + λ)-Archiving Algorithms. 235-249 - Gabriele Valentini, Luigi Malagò, Matteo Matteucci:
Optimization by ℓ1-Constrained Markov Fitness Modelling. 250-264 - James D. Walker, Gabriela Ochoa, Michel Gendreau, Edmund K. Burke:
Vehicle Routing and Adaptive Iterated Local Search within the HyFlex Hyper-heuristic Framework. 265-276 - L. Darrell Whitley, Francisco Chicano:
Quasi-elementary Landscapes and Superpositions of Elementary Landscapes. 277-291 - Tony Wauters, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
Fast Permutation Learning. 292-306 - Bo Yang, Liang Guang, Tero Säntti, Juha Plosila:
Parameter-Optimized Simulated Annealing for Application Mapping on Networks-on-Chip. 307-322 - Xi Yun, Susan L. Epstein:
Learning Algorithm Portfolios for Parallel Execution. 323-338
Short Papers
- Romain Benassi, Julien Bect, Emmanuel Vázquez:
Bayesian Optimization Using Sequential Monte Carlo. 339-342 - Yesnier Bravo, Gabriel Luque, Enrique Alba:
Influence of the Migration Period in Parallel Distributed GAs for Dynamic Optimization. 343-348 - Ching-Yuen Chan, Fan Xue, W. H. Ip, Benny C. F. Cheung:
A Hyper-Heuristic Inspired by Pearl Hunting. 349-353 - Tomasz Cichowicz, Maciej Drozdowski, Michal Frankiewicz, Grzegorz Pawlak, Filip Rytwinski, Jacek Wasilewski:
Five Phase and Genetic Hive Hyper-Heuristics for the Cross-Domain Search. 354-359 - Emanuele Corsano, Davide A. Cucci, Luigi Malagò, Matteo Matteucci:
Implicit Model Selection Based on Variable Transformations in Estimation of Distribution. 360-365 - Adrien Couëtoux, Hassen Doghmen, Olivier Teytaud:
Improving the Exploration in Upper Confidence Trees. 366-371 - Audrey Delevacq, Pierre Delisle, Michaël Krajecki:
Parallel GPU Implementation of Iterated Local Search for the Travelling Salesman Problem. 372-377 - Daniel Diaz, Florian Richoux, Philippe Codognet, Yves Caniou, Salvador Abreu:
Constraint-Based Local Search for the Costas Array Problem. 378-383 - Luca Di Gaspero, Tommaso Urli:
Evaluation of a Family of Reinforcement Learning Cross-Domain Optimization Heuristics. 384-389 - Adrien Goëffon, Frédéric Lardeux:
Autonomous Local Search Algorithms with Island Representation. 390-395 - Christian Grimme, Joachim Lepping:
An Approach to Instantly Use Single-Objective Results for Multi-objective Evolutionary Combinatorial Optimization. 396-401 - Federico Heras, António Morgado, João Marques-Silva:
Lower Bounds and Upper Bounds for MaxSAT. 402-407 - Helga Ingimundardottir, Thomas Philip Runarsson:
Determining the Characteristic of Difficult Job Shop Scheduling Instances for a Heuristic Solution Method. 408-412 - Janis Janusevskis, Rodolphe Le Riche, David Ginsbourger, Ramunas Girdziusas:
Expected Improvements for the Asynchronous Parallel Global Optimization of Expensive Functions: Potentials and Challenges. 413-418 - Leonard Judt, Olaf Mersmann, Boris Naujoks:
Effect of SMS-EMOA Parameterizations on Hypervolume Decreases. 419-424 - Peter Krcah:
Effects of Speciation on Evolution of Neural Networks in Highly Dynamic Environments. 425-430 - Adrian Kügel:
Natural Max-SAT Encoding of Min-SAT. 431-436 - Andreas Lehrbaum, Nysret Musliu:
A New Hyperheuristic Algorithm for Cross-Domain Search Problems. 437-442 - Julien Lepagnot, Amir Nakib, Hamouche Oulhadj, Patrick Siarry:
Brain Cine-MRI Sequences Registration Using B-Spline Free-Form Deformations and MLSDO Dynamic Optimization Algorithm. 443-448 - Ivan Martino, Giuseppe Nicosia:
Global Optimization for Algebraic Geometry - Computing Runge-Kutta Methods. 449-454 - Ruben Martins, Vasco Manquinho, Inês Lynce:
Clause Sharing in Parallel MaxSAT. 455-460 - Mustafa Misir, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
An Intelligent Hyper-Heuristic Framework for CHeSC 2011. 461-466 - Atefeh Moghaddam, Farouk Yalaoui, Lionel Amodeo:
An Efficient Meta-heuristic Based on Self-control Dominance Concept for a Bi-objective Re-entrant Scheduling Problem with Outsourcing. 467-471 - Rui Jorge Rei, João Pedro Pedroso, Hideitsu Hino, Noboru Murata:
A Tree Search Approach to Sparse Coding. 472-477 - Hiroyuki Sato, Carlos A. Coello Coello, Hernán E. Aguirre, Kiyoshi Tanaka:
Adaptive Control of the Number of Crossed Genes in Many-Objective Evolutionary Optimization. 478-484 - Tomohiro Sonobe, Mary Inaba:
Counter Implication Restart for Parallel SAT Solvers. 485-490 - Dirk Thierens, Peter A. N. Bosman:
Learning the Neighborhood with the Linkage Tree Genetic Algorithm. 491-496 - Nadarajen Veerapen, Jorge Maturana, Frédéric Saubion:
A Comparison of Operator Utility Measures for On-Line Operator Selection in Local Search. 497-502 - Paolo Viappiani:
Monte Carlo Methods for Preference Learning. 503-508 - Stefan Voß, Andreas Fink:
Hybridizing Reactive Tabu Search with Simulated Annealing. 509-512
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-29 02:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
