Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th LION 2013: Catania, Italy
- Giuseppe Nicosia, Panos M. Pardalos:
Learning and Intelligent Optimization - 7th International Conference, LION 7, Catania, Italy, January 7-11, 2013, Revised Selected Papers. Lecture Notes in Computer Science 7997, Springer 2013, ISBN 978-3-642-44972-7 - Amos H. C. Ng, Catarina Dudas, Henrik Boström, Kalyanmoy Deb:
Interleaving Innovization with Evolutionary Multi-Objective Optimization in Production System Simulation for Faster Convergence. 1-18 - Sergio Consoli
, José Andrés Moreno-Pérez, Nenad Mladenovic:
Intelligent Optimization for the Minimum Labelling Spanning Tree Problem. 19-23 - John Ahlgren, Shiu Yin Yuen:
A Constraint Satisfaction Approach to Tractable Theory Induction. 24-29 - Tinus Abell, Yuri Malitsky, Kevin Tierney:
Features for Exploiting Black-Box Optimization Problem Structure. 30-36 - Julie Jacques, Julien Taillard, David Delerue, Laetitia Jourdan, Clarisse Dhaenens:
MOCA-I: Discovering Rules and Guiding Decision Maker in the Context of Partial Classification in Large and Imbalanced Datasets. 37-51 - Davide Lanti, Norbert Manthey:
Sharing Information in Parallel Search with Search Space Partitioning. 52-58 - Clément Chevalier, David Ginsbourger:
Fast Computation of the Multi-Points Expected Improvement with Applications in Batch Selection. 59-69 - Heike Trautmann, Tobias Wagner, Dimo Brockhoff:
R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection. 70-74 - Shunji Umetani, Masanao Arakawa, Mutsunori Yagiura:
A Heuristic Algorithm for the Set Multicover Problem with Generalized Upper Bound Constraints. 75-80 - Petrica C. Pop, Oliviu Matei:
A Genetic Algorithm Approach for the Multidimensional Two-Way Number Partitioning Problem. 81-86 - Trong-Tuan Vu, Bilel Derbel, Nouredine Melab:
Adaptive Dynamic Load Balancing in Heterogeneous Multiple GPUs-CPUs Distributed Setting: Case Study of B&B Tree Search. 87-103 - Mohamed Elati, Cuong To, Rémy Nicolle:
Multi-Objective Optimization for Relevant Sub-graph Extraction. 104-109 - Stefan Hess, Tobias Wagner, Bernd Bischl:
PROGRESS: Progressive Reinforcement-Learning-Based Surrogate Selection. 110-124 - Marie-Eléonore Marmion, Aymeric Blot, Laetitia Jourdan, Clarisse Dhaenens:
Neutrality in the Graph Coloring Problem. 125-130 - Gilad Liberman, Tal Vider-Shalit, Yoram Louzoun:
Kernel Multi Label Vector Optimization (kMLVO): A Unified Multi-Label Classification Formalism. 131-137 - Holger H. Hoos, Benjamin Kaufmann, Torsten Schaub, Marius Schneider:
Robust Benchmark Set Selection for Boolean Constraint Solvers. 138-152 - Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann:
Boosting Sequential Solver Portfolios: Knowledge Sharing and Accuracy Prediction. 153-167 - Duy Tin Truong:
A Fast and Adaptive Local Search Algorithm for Multi-Objective Optimization. 168-173 - Mariela Nogueira, Carlos Cotta, Antonio José Fernández Leiva:
An Analysis of Hall-of-Fame Strategies in Competitive Coevolutionary Algorithms for Self-Learning in RTS Games. 174-188 - Dario Maggiorini, Simone Previti, Laura Anna Ripamonti, Marco Trubian:
Resources Optimization in (Video) Games: A Novel Approach to Teach Applied Mathematics? 189-195 - Mauro Leoncini, Manuela Montangero, Marco Pellegrini, Karina Panucia Tillan:
CMF: A Combinatorial Tool to Find Composite Motifs. 196-208 - Matthieu Basseur, Adrien Goëffon:
Hill-Climbing Behavior on Quantized NK-Landscapes. 209-214 - Hisao Ishibuchi, Koichiro Hoshino, Yusuke Nojima:
Neighborhood Specification for Game Strategy Evolution in a Spatial Iterated Prisoner's Dilemma Game. 215-230 - Hisao Ishibuchi, Naoya Akedo, Yusuke Nojima:
A Study on the Specification of a Scalarizing Function in MOEA/D for Many-Objective Knapsack Problems. 231-246 - Tomohiro Sonobe, Mary Inaba:
Portfolio with Block Branching for Parallel SAT Solvers. 247-252 - Caner Candan, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion:
Parameter Setting with Dynamic Island Models. 253-258 - Sohaib Afifi, Duc-Cuong Dang, Aziz Moukrim:
A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints. 259-265 - Rosa M. V. Figueiredo, Yuri Frota, Martine Labbé:
Solution of the Maximum $$k$$ k -Balanced Subgraph Problem. 266-271 - Jürgen Branke, Jawad Elomari:
Racing with a Fixed Budget and a Self-Adaptive Significance Level. 272-280 - Clément Pira, Christian Artigues:
An Efficient Best Response Heuristic for a Non-preemptive Strictly Periodic Scheduling Problem. 281-287 - Juan Julián Merelo Guervós, Antonio Miguel Mora, Carlos Cotta, Antonio José Fernández Leiva:
Finding an Evolutionary Solution to the Game of Mastermind with Good Scaling Behavior. 288-293 - Laurent Moalic, Alexandre Caminada, Sid Lamrous:
A Fast Local Search Approach for Multiobjective Problems. 294-298 - Leticia Hernando, Alexander Mendiburu, José Antonio Lozano:
Generating Customized Landscapes in Permutation-Based Combinatorial Optimization Problems. 299-303 - David Iclanzan, Noémi Gaskó, Réka Nagy, D. Dumitrescu:
Multiobjective Evolution of Mixed Nash Equilibria. 304-314 - Manuel Loth, Michèle Sebag, Youssef Hamadi, Marc Schoenauer, Christian Schulte:
Hybridizing Constraint Programming and Monte-Carlo Tree Search: Application to the Job Shop Problem. 315-320 - Franco Mascia, Manuel López-Ibáñez, Jérémie Dubois-Lacoste, Thomas Stützle:
From Grammars to Parameters: Automatic Iterated Greedy Design for the Permutation Flow-Shop Problem with Weighted Tardiness. 321-334 - Natalia Padilla Zea, José Rafael López-Arcos, Francisco Luis Gutiérrez Vela, Patricia Paderewski, Nuria Medina-Medina:
Architecture for Monitoring Learning Processes Using Video Games. 335-340 - Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant:
Quality Measures of Parameter Tuning for Aggregated Multi-Objective Temporal Planning. 341-356 - R. M. Hidalgo-Bermúdez, M. S. Rodríguez-Domingo, Antonio Miguel Mora, Pablo García-Sánchez, Juan Julián Merelo Guervós, Antonio José Fernández Leiva:
Evolutionary FSM-Based Agents for Playing Super Mario Game. 357-363 - Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown:
Identifying Key Algorithm Parameters and Instance Features Using Forward Selection. 364-381 - James Styles, Holger H. Hoos:
Using Racing to Automatically Configure Algorithms for Scaling Performance. 382-388 - Nysret Musliu, Martin Schwengerer:
Algorithm Selection for the Graph Coloring Problem. 389-403 - Shahriar Asta, Ender Özcan, Andrew J. Parkes:
Batched Mode Hyper-heuristics. 404-409 - Franco Mascia, Mauro Birattari, Thomas Stützle:
Tuning Algorithms for Tackling Large Instances: An Experimental Protocol. 410-422 - Lindawati, Zhi Yuan, Hoong Chuin Lau, Feida Zhu:
Automated Parameter Tuning Framework for Heterogeneous and Large Instances: Case Study in Quadratic Assignment Problem. 423-437 - Natsuki Kusuno, Hernán E. Aguirre, Kiyoshi Tanaka, Masataka Koishi:
Practically Desirable Solutions Search on Multi-Objective Optimization. 438-443 - Juan Luis Jiménez Laredo, Bernabé Dorronsoro Díaz, Carlos M. Fernandes, Juan Julián Merelo Guervós, Pascal Bouvry:
Oversized Populations and Cooperative Selection: Dealing with Massive Resources in Parallel Infrastructures. 444-449 - Hernán E. Aguirre, Arnaud Liefooghe, Sébastien Vérel, Kiyoshi Tanaka:
Effects of Population Size on Selection and Scalability in Evolutionary Many-Objective Optimization. 450-454 - Maria Brigida Ferraro, Antonio Irpino, Rosanna Verde, Mario Rosario Guarracino:
A Novel Feature Selection Method for Classification Using a Fuzzy Criterion. 455-467
a service of 
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 2024-05-04 23:58 CEST 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:
