Table of Contents

• Iterative-Deepening Search with On-Line Tree Size PredictionEthan Burns, Wheeler Ruml. 1-15 [doi]
• A Learning Optimization Algorithm in Graph Theory - Versatile Search for Extremal Graphs Using a Learning AlgorithmGilles Caporossi, Pierre Hansen. 16-30 [doi]
• A Math-Heuristic Dantzig-Wolfe Algorithm for the Capacitated Lot Sizing ProblemMarco Caserta, Stefan Voß. 31-41 [doi]
• Application of the Nested Rollout Policy Adaptation Algorithm to the Traveling Salesman Problem with Time WindowsTristan Cazenave, Fabien Teytaud. 42-54 [doi]
• Parallel Algorithm ConfigurationFrank Hutter, Holger H. Hoos, Kevin Leyton-Brown. 55-70 [doi]
• Community Detection in Social and Biological Networks Using Differential EvolutionGuanbo Jia, Zixing Cai, Mirco Musolesi, Yong Wang, Dan A. Tennant, Ralf J. M. Weber, John K. Heath, Shan He 0001. 71-85 [doi]
• A Study on Large Population MOEA Using Adaptive ε-Box Dominance and Neighborhood Recombination for Many-Objective OptimizationNaoya Kowatari, Akira Oyama, Hernán E. Aguirre, Kiyoshi Tanaka. 86-100 [doi]
• A Non-adaptive Stochastic Local Search Algorithm for the CHeSC 2011 CompetitionFranco Mascia, Thomas Stützle. 101-114 [doi]
• Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem HardnessOlaf Mersmann, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner 0007, Frank Neumann. 115-129 [doi]
• Evaluating Tree-Decomposition Based Algorithms for Answer Set ProgrammingMichael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran. 130-144 [doi]
• High-Dimensional Model-Based Optimization Based on Noisy Evaluations of Computer GamesMike Preuss, Tobias Wagner, David Ginsbourger. 145-159 [doi]
• Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop SchedulingThomas Philip Runarsson, Marc Schoenauer, Michèle Sebag. 160-174 [doi]
• Minimizing Time When Applying Bootstrap to Contingency Tables Analysis of Genome-Wide DataFrancesco Sambo, Barbara Di Camillo. 175-189 [doi]
• Quantifying Homogeneity of Instance Sets for Algorithm ConfigurationMarius Schneider, Holger H. Hoos. 190-204 [doi]
• Automatically Configuring Algorithms for Scaling PerformanceJames Styles, Holger H. Hoos, Martin Müller 0003. 205-219 [doi]
• Upper Confidence Tree-Based Consistent Reactive Planning Application to MineSweeperMichèle Sebag, Olivier Teytaud. 220-234 [doi]
• Bounding the Effectiveness of Hypervolume-Based (μ + λ)-Archiving AlgorithmsTamara Ulrich, Lothar Thiele. 235-249 [doi]
• Optimization by ℓ1-Constrained Markov Fitness ModellingGabriele Valentini, Luigi Malagò, Matteo Matteucci. 250-264 [doi]
• Vehicle Routing and Adaptive Iterated Local Search within the HyFlex Hyper-heuristic FrameworkJames D. Walker, Gabriela Ochoa, Michel Gendreau, Edmund K. Burke. 265-276 [doi]
• Quasi-elementary Landscapes and Superpositions of Elementary LandscapesDarrell Whitley, J. Francisco Chicano. 277-291 [doi]
• Fast Permutation LearningTony Wauters, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe. 292-306 [doi]
• Parameter-Optimized Simulated Annealing for Application Mapping on Networks-on-ChipBo Yang 0009, Liang Guang, Tero Säntti, Juha Plosila. 307-322 [doi]
• Learning Algorithm Portfolios for Parallel ExecutionXi Yun, Susan L. Epstein. 323-338 [doi]
• Bayesian Optimization Using Sequential Monte CarloRomain Benassi, Julien Bect, Emmanuel Vázquez. 339-342 [doi]
• Influence of the Migration Period in Parallel Distributed GAs for Dynamic OptimizationYesnier Bravo, Gabriel Luque, Enrique Alba. 343-348 [doi]
• A Hyper-Heuristic Inspired by Pearl HuntingChing-Yuen Chan, Fan Xue, W. H. Ip, C. F. Cheung. 349-353 [doi]
• Five Phase and Genetic Hive Hyper-Heuristics for the Cross-Domain SearchTomasz Cichowicz, Maciej Drozdowski, Michal Frankiewicz, Grzegorz Pawlak, Filip Rytwinski, Jacek Wasilewski. 354-359 [doi]
• Implicit Model Selection Based on Variable Transformations in Estimation of DistributionEmanuele Corsano, Davide Cucci, Luigi Malagò, Matteo Matteucci. 360-365 [doi]
• Improving the Exploration in Upper Confidence TreesAdrien Couëtoux, Hassen Doghmen, Olivier Teytaud. 366-371 [doi]
• Parallel GPU Implementation of Iterated Local Search for the Travelling Salesman ProblemAudrey Delevacq, Pierre Delisle, Michaël Krajecki. 372-377 [doi]
• Constraint-Based Local Search for the Costas Array ProblemDaniel Diaz, Florian Richoux, Philippe Codognet, Yves Caniou, Salvador Abreu. 378-383 [doi]
• Evaluation of a Family of Reinforcement Learning Cross-Domain Optimization HeuristicsLuca Di Gaspero, Tommaso Urli. 384-389 [doi]
• Autonomous Local Search Algorithms with Island RepresentationAdrien Goëffon, Frédéric Lardeux. 390-395 [doi]
• An Approach to Instantly Use Single-Objective Results for Multi-objective Evolutionary Combinatorial OptimizationChristian Grimme, Joachim Lepping. 396-401 [doi]
• Lower Bounds and Upper Bounds for MaxSATFederico Heras, António Morgado, João Marques-Silva. 402-407 [doi]
• Determining the Characteristic of Difficult Job Shop Scheduling Instances for a Heuristic Solution MethodHelga Ingimundardottir, Thomas Philip Runarsson. 408-412 [doi]
• Expected Improvements for the Asynchronous Parallel Global Optimization of Expensive Functions: Potentials and ChallengesJanis Janusevskis, Rodolphe Le Riche, David Ginsbourger, Ramunas Girdziusas. 413-418 [doi]
• Effect of SMS-EMOA Parameterizations on Hypervolume DecreasesLeonard Judt, Olaf Mersmann, Boris Naujoks. 419-424 [doi]
• Effects of Speciation on Evolution of Neural Networks in Highly Dynamic EnvironmentsPeter Krcah. 425-430 [doi]
• Natural Max-SAT Encoding of Min-SATAdrian Kügel. 431-436 [doi]
• A New Hyperheuristic Algorithm for Cross-Domain Search ProblemsAndreas Lehrbaum, Nysret Musliu. 437-442 [doi]
• Brain Cine-MRI Sequences Registration Using B-Spline Free-Form Deformations and MLSDO Dynamic Optimization AlgorithmJulien Lepagnot, Amir Nakib, Hamouche Oulhadj, Patrick Siarry. 443-448 [doi]
• Global Optimization for Algebraic Geometry - Computing Runge-Kutta MethodsIvan Martino, Giuseppe Nicosia. 449-454 [doi]
• Clause Sharing in Parallel MaxSATRuben Martins, Vasco M. Manquinho, Inês Lynce. 455-460 [doi]
• An Intelligent Hyper-Heuristic Framework for CHeSC 2011Mustafa Misir, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe. 461-466 [doi]
• An Efficient Meta-heuristic Based on Self-control Dominance Concept for a Bi-objective Re-entrant Scheduling Problem with OutsourcingAtefeh Moghaddam, Farouk Yalaoui, Lionel Amodeo. 467-471 [doi]
• A Tree Search Approach to Sparse CodingRui Jorge Rei, João Pedro Pedroso, Hideitsu Hino, Noboru Murata. 472-477 [doi]
• Adaptive Control of the Number of Crossed Genes in Many-Objective Evolutionary OptimizationHiroyuki Sato, Carlos A. Coello Coello, Hernán E. Aguirre, Kiyoshi Tanaka. 478-484 [doi]
• Counter Implication Restart for Parallel SAT SolversTomohiro Sonobe, Mary Inaba. 485-490 [doi]
• Learning the Neighborhood with the Linkage Tree Genetic AlgorithmDirk Thierens, Peter A. N. Bosman. 491-496 [doi]
• A Comparison of Operator Utility Measures for On-Line Operator Selection in Local SearchNadarajen Veerapen, Jorge Maturana, Frédéric Saubion. 497-502 [doi]
• Monte Carlo Methods for Preference LearningPaolo Viappiani. 503-508 [doi]
• Hybridizing Reactive Tabu Search with Simulated AnnealingStefan Voß, Andreas Fink. 509-512 [doi]