Výsledky vyhľadávania - Per-Instance Algorithm Configuration

Per-Instance Algorithm Configuration in Homogeneous Instance Spaces: A Use Case in Reconfigurable Assembly Systems Autor Guzman Vargas, Daniel, Gautama, Sidharta, Uzunosmanoglu, Mehmet, Raa, Birger, Limère, Veronique

“…-all” approach, recent studies have shown the potential of per-instance algorithm configuration (PIAC…”
Získať plný text

Per-instance algorithm configuration for production planning in a reconfigurable assembly system Autor Vargas, Daniel Guzman, Gautama, Sidharta, Uzunosmanoglu, Mehmet, Raa, Birger, Limere, Veronique

“… solution of these problems. In this work, we investigate the use of Per-instance algorithm configuration (PIAC…”
Získať plný text

Using Reinforcement Learning for Per-Instance Algorithm Configuration on the TSP Autor Vinzent Seiler, Moritz, Rook, Jeroen, Heins, Jonathan, Ludger Preub, Oliver, Bossek, Jakob, Trautmann, Heike

“… We explore the potential of Per-Instance Algorithm Configuration (PIAC) by using Reinforcement Learning (RL…”
Získať plný text

Stochastic local search and parameters recommendation: a case study on flowshop problems Autor Pavelski, Lucas M., Delgado, Myriam, Kessaci, Marie‐Éléonore, Freitas, Alex A.

“…‐instance Algorithm Configuration Problem, is still considered a challenging task. This paper investigates the use of meta…”
Získať plný text

Beyond Landscape Analysis: DynamoRep Features For Capturing Algorithm-Problem Interaction In Single-Objective Continuous Optimization Autor Cenikj, Gjorgjina, Petelin, Gašper, Doerr, Carola, Korošec, Peter, Eftimov, Tome

“… of optimization algorithms, and the quality of existing problem benchmarks, as well as for automated per-instance algorithm selection and configuration approaches…”
Zistit podrobnosti o prístupe

Automated Algorithm Selection: Survey and Perspectives Autor Kerschke, Pascal, Hoos, Holger H, Neumann, Frank, Trautmann, Heike

“…It has long been observed that for practically any computational problem that has been intensely studied, different instances are best solved using different algorithms…”
Zistit podrobnosti o prístupe

Linear Matrix Factorization Embeddings for Single-objective Optimization Landscapes Autor Eftimov, Tome, Popovski, Gorjan, Renau, Quentin, Korosec, Peter, Doerr, Carola

“…Automated per-instance algorithm selection and configuration have shown promising performances for a number of classic optimization problems, including satisfiability, AI planning, and TSP…”
Získať plný text

Elastic Task Offloading and Resource Allocation Over Hybrid Cloud: A Reinforcement Learning Approach Autor Zhang, Jiayin, Yu, Huiqun, Fan, Guisheng, Li, Zengpeng

“…Hybrid cloud is an emerging computing cloud solution that leverages the power of the public cloud, without abandoning the computation resources of existing…”
Získať plný text

Characterising fitness landscapes with fitness-probability cloud and its applications to algorithm configuration Autor Lu, Guanzhou

“… instances, even to dynamically determine the best algorithm configuration during different stages of a search algorithm…”
Získať plný text

Generating Instances with Performance Differences for More Than Just Two Algorithms Autor Bossek, Jakob, Wagner, Markus

“… Repeating this process is useful to gain insights into strengths/weaknesses of certain algorithms or to build a set of instances with strong performance differences as a foundation for automatic per…”
Získať plný text

Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis Autor Prager, Raphael Patrick, Trautmann, Heike, Wang, Hao, Back, Thomas H. W., Kerschke, Pascal

“… is not. We propose a well-performing instance-specific algorithm configuration model which selects…”
Získať plný text

An Analysis of Effective Per-instance Tailored GAs for the Permutation Flowshop Scheduling Problem Autor Bacha, Sarra Zohra Ahmed, Tayeb, Fatima Benbouzid-Si, Benatchba, Karima

“…In this paper, we analyze the results of two hyper-heuristics HHGA and HHabs that generate per-instances genetic algorithms for the permutation flow shop problem…”
Získať plný text

Selection-based Per-Instance Heuristic Generation for Protein Structure Prediction of 2D HP Model Autor Misir, Mustafa

“… The resulting structure directly relates to the functionalities of the protein. There are a wide range of algorithms to address Protein Structure Prediction as an optimization problem…”
Získať plný text

Performance prediction using support vector machine for the configuration of optimization algorithms Autor Afia, Abdellatif El, Sarhani, Malek

“… Our approach consists of advocating making the decision of finding the most suitable configuration on a per-instance analysis based on a supervised machine learning model…”
Získať plný text

Linear Matrix Factorization Embeddings for Single-objective Optimization Landscapes Autor Tome Eftimov, Popovski, Gorjan, Renau, Quentin, Korosec, Peter, Doerr, Carola

“…Automated per-instance algorithm selection and configuration have shown promising performances for a number of classic optimization problems, including satisfiability, AI planning, and TSP…”
Získať plný text

The Algorithm Configuration Problem Autor Iommazzo, Gabriele, D'Ambrosio, Claudia, Frangioni, Antonio, Liberti, Leo

“… This article delves into the Algorithm Configuration Problem, focused on optimizing parametrized algorithms for solving specific instances of decision/optimization problems…”
Získať plný text

RF+clust for Leave-One-Problem-Out Performance Prediction Autor Nikolikj, Ana, Doerr, Carola, Tome Eftimov

“…Per-instance automated algorithm configuration and selection are gaining significant moments in evolutionary computation in recent years…”
Získať plný text

Distance approximation to support customer selection in vehicle routing problems Autor Akkerman, Fabian, Mes, Martijn

“… The model is validated on a fictional case with different spatial instances considering both a backordering and lost sales configuration, and on a…”
Získať plný text

ASlib: A benchmark library for algorithm selection Autor Bischl, Bernd, Kerschke, Pascal, Kotthoff, Lars, Lindauer, Marius, Malitsky, Yuri, Fréchette, Alexandre, Hoos, Holger, Hutter, Frank, Leyton-Brown, Kevin, Tierney, Kevin, Vanschoren, Joaquin

“…The task of algorithm selection involves choosing an algorithm from a set of algorithms on a per-instance basis in order to exploit the varying performance of algorithms over a set of instances…”
Získať plný text

Automated Algorithm Selection: Survey and Perspectives Autor Kerschke, Pascal, Hoos, Holger H, Neumann, Frank, Trautmann, Heike

“…It has long been observed that for practically any computational problem that has been intensely studied, different instances are best solved using different algorithms…”
Získať plný text