![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
5th LION 2011: Rome, Italy
- Carlos A. Coello Coello:
Learning and Intelligent Optimization - 5th International Conference, LION 5, Rome, Italy, January 17-21, 2011. Selected Papers. Lecture Notes in Computer Science 6683, Springer 2011, ISBN 978-3-642-25565-6
Main Track (Regular Papers)
- Olcay Taner Yildiz
, Özlem Aslan, Ethem Alpaydin
:
Multivariate Statistical Tests for Comparing Classification Algorithms. 1-15 - Michael Kampouridis
, Edward P. K. Tsang:
Using Hyperheuristics under a GP Framework for Financial Forecasting. 16-30 - Sébastien Vérel
, Arnaud Liefooghe
, Jérémie Humeau, Laetitia Jourdan
, Clarisse Dhaenens
:
On the Effect of Connectedness for Biobjective Multiple and Long Path Problems. 31-45 - Alejandro Arbelaez
, Youssef Hamadi:
Improving Parallel Local Search for SAT. 46-60 - Stefanie Kritzinger, Fabien Tricoire
, Karl F. Doerner, Richard F. Hartl
:
Variable Neighborhood Search for the Time-Dependent Vehicle Routing Problem with Soft Time Windows. 61-75 - Lukas Baumgartner, Verena Schmid, Christian Blum
:
Solving the Two-Dimensional Bin Packing Problem with a Probabilistic Multi-start Heuristic. 76-90 - Hiroyuki Sato, Hernán E. Aguirre, Kiyoshi Tanaka:
Genetic Diversity and Effective Crossover in Evolutionary Many-objective Optimization. 91-105 - Gianluca Bontempi
:
An Optimal Stopping Strategy for Online Calibration in Local Search. 106-115 - Sébastien Vérel
, Arnaud Liefooghe
, Laetitia Jourdan
, Clarisse Dhaenens
:
Analyzing the Effect of Objective Correlation on the Efficient Set of MNK-Landscapes. 116-130 - Lindawati, Hoong Chuin Lau
, David Lo
:
Instance-Based Parameter Tuning via Search Trajectory Similarity Clustering. 131-145 - Celso C. Ribeiro
, Isabel Rosseti
, Reinaldo C. Souza:
Effective Probabilistic Stopping Rules for Randomized Metaheuristics: GRASP Implementations. 146-160 - Yoel Tenne, Kazuhiro Izui
, Shinji Nishiwaki:
A Classifier-Assisted Framework for Expensive Optimization Problems: A Knowledge-Mining Approach. 161-175 - Romain Benassi, Julien Bect
, Emmanuel Vázquez:
Robust Gaussian Process-Based Global Optimization Using a Fully Bayesian Expected Improvement Criterion. 176-190 - Satoshi Kaneko, Akira Hayashi, Nobuo Suematsu, Kazunori Iwata:
Hierarchical Hidden Conditional Random Fields for Information Extraction. 191-202 - Asim Munawar, Mohamed Wahib, Masaharu Munetomo, Kiyoshi Akama:
Solving Extremely Difficult MINLP Problems Using Adaptive Resolution Micro-GA with Tabu Search. 203-217 - Jiaxing Ye
, Takumi Kobayashi, Tetsuya Higuchi, Nobuyuki Otsu:
Adaptive Abnormality Detection on ECG Signal by Utilizing FLAC Features. 218-225 - Juan J. Flores
, Rodrigo López, Julio Barrera:
Gravitational Interactions Optimization. 226-237 - Marie-Eléonore Marmion
, Clarisse Dhaenens
, Laetitia Jourdan
, Arnaud Liefooghe
, Sébastien Vérel
:
On the Neutrality of Flowshop Scheduling Fitness Landscapes. 238-252 - Yailen Martínez, Ann Nowé, Juliett Suárez, Rafael Bello
:
A Reinforcement Learning Approach for the Flexible Job Shop Scheduling Problem. 253-262 - Helga Ingimundardottir
, Thomas Philip Runarsson
:
Supervised Learning Linear Priority Dispatch Rules for Job-Shop Scheduling. 263-277 - Aldy Gunawan, Hoong Chuin Lau
, Lindawati:
Fine-Tuning Algorithm Parameters Using the Design of Experiments Approach. 278-292 - Alessandro Turco:
MetaHybrid: Combining Metamodels and Gradient-Based Techniques in a Hybrid Multi-Objective Genetic Algorithm. 293-307 - Wasan Shaker Awad:
Designing Stream Cipher Systems Using Genetic Programming. 308-320 - Thé Van Luong
, Nouredine Melab, El-Ghazali Talbi:
GPU-Based Multi-start Local Search Algorithms. 321-335 - Paolo Campigotto, Andrea Passerini
, Roberto Battiti
:
Active Learning of Combinatorial Features for Interactive Optimization. 336-350 - Madalina Raschip
, Cornelius Croitoru:
A Genetic Algorithm Hybridized with the Discrete Lagrangian Method for Trap Escaping. 351-363 - Nabil Belgasmi, Lamjed Ben Said
, Khaled Ghédira:
Greedy Local Improvement of SPEA2 Algorithm to Solve the Multiobjective Capacitated Transshipment Problem. 364-378 - Sujin Bureerat
:
Hybrid Population-Based Incremental Learning Using Real Codes. 379-391 - Nadarajen Veerapen
, Frédéric Saubion:
Pareto Autonomous Local Search. 392-406 - Antonio Frangioni
, Luis Perez Sanchez:
Transforming Mathematical Models Using Declarative Reformulation Rules. 407-422 - Thomas Philip Runarsson
:
Learning Heuristic Policies - A Reinforcement Learning Problem. 423-432 - Adrien Couëtoux, Jean-Baptiste Hoock, Nataliya Sokolovska, Olivier Teytaud, Nicolas Bonnard:
Continuous Upper Confidence Trees. 433-445
Main Track (Short Papers)
- David J. J. Toal, Andy J. Keane:
Towards an Intelligent Non-stationary Performance Prediction of Engineering Systems. 446-449 - Luca Di Gaspero
, Giacomo di Tollo, Andrea Roli
, Andrea Schaerf
:
Local Search for Constrained Financial Portfolio Selection Problems with Short Sellings. 450-453 - Gabriela Ochoa
, Sébastien Vérel
, Fabio Daolio, Marco Tomassini:
Clustering of Local Optima in Combinatorial Fitness Landscapes. 454-457
Special Session: IMON
- Luis Martí
, Jesús García
, Antonio Berlanga
, José M. Molina
:
Multi-Objective Optimization with an Adaptive Resonance Theory-Based Estimation of Distribution Algorithm: A Comparative Study. 458-472 - Ke Li
, Álvaro Fialho, Sam Kwong
:
Multi-Objective Differential Evolution with Adaptive Control of Parameters and Operators. 473-487 - Juan José Durillo
, Qingfu Zhang
, Antonio J. Nebro
, Enrique Alba
:
Distribution of Computational Effort in Parallel MOEA/D. 488-502 - Mauro Castelli
, Luca Manzoni
, Leonardo Vanneschi
:
Multi Objective Genetic Programming for Feature Construction in Classification Problems. 503-506
Special Session: LION-PP
- Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown
:
Sequential Model-Based Optimization for General Algorithm Configuration. 507-523 - Kate Smith-Miles
, Leo Lopes:
Generalising Algorithm Performance in Instance Space: A Timetabling Case Study. 524-538
Special Session: Self* EAs
- Hamza Turabieh
, Salwani Abdullah:
A Hybrid Fish Swarm Optimisation Algorithm for Solving Examination Timetabling Problems. 539-551 - Carlos M. Fernandes
, Juan Luis Jiménez Laredo
, Antonio Miguel Mora, Agostinho C. Rosa
, Juan Julián Merelo Guervós
:
The Sandpile Mutation Operator for Genetic Algorithms. 552-566 - Saúl Zapotecas Martínez
, Edgar G. Yáñez Oropeza, Carlos A. Coello Coello
:
Self-adaptation Techniques Applied to Multi-Objective Evolutionary Algorithms. 567-581 - Juan Luis Jiménez Laredo
, Juan Julián Merelo Guervós
, Carlos M. Fernandes
, Antonio Miguel Mora, Maribel García Arenas
, Pedro A. Castillo
, Pablo García-Sánchez
:
Analysing the Performance of Different Population Structures for an Agent-Based Evolutionary Algorithm. 582-585
Special Session: LION-SWAP
- Adrian Balint, Daniel Diepold, Daniel Gall, Simon Gerber, Gregor Kapler, Robert Retz:
EDACC - An Advanced Platform for the Experiment Design, Administration and Analysis of Empirical Algorithms. 586-599 - Christopher Nell, Chris Fawcett, Holger H. Hoos, Kevin Leyton-Brown
:
HAL: A Framework for the Automated Analysis and Design of High-Performance Algorithms. 600-615 - Jerry Swan, Ender Özcan
, Graham Kendall
:
Hyperion - A Recursive Hyper-Heuristic Framework. 616-630 - Edmund K. Burke, Michel Gendreau, Matthew R. Hyde, Graham Kendall, Barry McCollum, Gabriela Ochoa
, Andrew J. Parkes
, Sanja Petrovic:
The Cross-Domain Heuristic Search Challenge - An International Research Competition. 631-634
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.