Search Results - "algorithm selection problem"

Metalearning and Recommender Systems: A literature review and empirical study on the algorithm selection problem for Collaborative Filtering by Cunha, Tiago, Soares, Carlos, de Carvalho, André C.P.L.F.

“…The problem of information overload motivated the appearance of Recommender Systems. From the several open problems in this area, the decision of which is the…”
Get full text

Addressing the Algorithm Selection Problem through an Attention-Based Meta-Learner Approach by Díaz de León-Hicks, Enrique, Conant-Pablos, Santiago Enrique, Ortiz-Bayliss, José Carlos, Terashima-Marín, Hugo

“…In the algorithm selection problem, where the task is to identify the most suitable solving technique for a particular situation, most methods used as performance mapping mechanisms…”
Get full text

Optimal decision trees for the algorithm selection problem: integer programming based approaches by Vilas Boas, Matheus Guedes, Santos, Haroldo Gambini, Merschmann, Luiz Henrique de Campos, Vanden Berghe, Greet

“…‐based approaches to build decision trees for the algorithm selection problem. These techniques allow the automation of three crucial decisions…”
Get full text

Meta‐learning how to forecast time series by Talagala, Thiyanga S., Hyndman, Rob J., Athanasopoulos, George

“…Features of time series are useful in identifying suitable models for forecasting. We present a general framework, labelled Feature‐based FORecast Model…”
Get full text

Applying instance space analysis for metaheuristic selection to the 0–1 multidemand multidimensional knapsack problem by Scherer, Matthew E., Hill, Raymond R., Lunday, Brian J., Cox, Bruce A., White, Edward D.

“…The empirical testing of metaheuristic solution methods for optimization applications should consider the effect of the underlying structure of the…”
Get full text

Transformer-based placement heuristic for online 2D strip packing problem by Kaleta, Mariusz, Kołodziejczyk, Waldemar, Zoltowska, Izabela

“…This paper addresses the online 2D Strip Packing Problem (2D-SPP), where rectangular items must be packed sequentially into a strip of fixed width, with the…”
Get full text

Framework of algorithm portfolios for strip packing problem by Piechowiak, Kamil, Drozdowski, Maciej, Sanlaville, Éric

“…In this paper selection of fast algorithm portfolios for 2SP packing problem is considered. The 2SP problem consists in placing rectangles on a strip of the…”
Get full text

Neural-Driven heuristic for strip packing trained with Black-Box optimization by Kaleta, Mariusz, Śliwiński, Tomasz

“…We address the well-known NP-hard problem of packing rectangular items into a strip, a problem of significant importance in electronics (e.g., packing…”
Get full text

A framework to select heuristics for the rectangular two-dimensional strip packing problem by Neuenfeldt Júnior, Alvaro, Siluk, Julio, Francescatto, Matheus, Stieler, Gabriel, Disconzi, David

“… As a decision-making process, one of the most practical and useful ways to treat and solve algorithm selection problems is using supervised machine learning techniques to search for patterns…”
Get full text

Heuristics for online three-dimensional packing problems and algorithm selection framework for semi-online with full look-ahead by Ali, Sara, Ramos, António Galrão, Carravilla, Maria Antónia, Oliveira, José Fernando

“…In online three-dimensional packing problems (3D-PPs), unlike offline problems, items arrive sequentially and require immediate packing decisions without any…”
Get full text

Selecting algorithms for large berth allocation problems by Wawrzyniak, Jakub, Drozdowski, Maciej, Sanlaville, Éric

“… The algorithm selection problem (ASP) consists in selecting algorithms with the best performance for a considered application…”
Get full text

On normalization and algorithm selection for unsupervised outlier detection by Kandanaarachchi, Sevvandi, Muñoz, Mario A., Hyndman, Rob J., Smith-Miles, Kate

“…This paper demonstrates that the performance of various outlier detection methods is sensitive to both the characteristics of the dataset, and the data…”
Get full text

The Algorithm Selection Problem for Solving Sudoku with Metaheuristics by Notice, Danielle, Kheiri, Ahmed, Pavlidis, Nicos G.

“…In this paper we study the algorithm selection problem and instance space analysis for solving Sudoku puzzles with metaheuristic algorithms…”
Get full text

Improving the state-of-the-art in the Traveling Salesman Problem: An Anytime Automatic Algorithm Selection by Huerta, Isaías I., Neira, Daniel A., Ortega, Daniel A., Varas, Vicente, Godoy, Julio, Asín-Achá, Roberto

“…This work presents a new metaheuristic for the euclidean Traveling Salesman Problem (TSP) based on an Anytime Automatic Algorithm Selection model using a…”
Get full text

A machine learning approach for predicting the best heuristic for a large scaled Capacitated Lotsizing Problem by Kärcher, Jens, Meyr, Herbert

“…For some NP-hard lotsizing problems, many different heuristics exist, but they have different solution qualities and computation times depending on the…”
Get full text

Anytime automatic algorithm selection for knapsack by Huerta, Isaías I., Neira, Daniel A., Ortega, Daniel A., Varas, Vicente, Godoy, Julio, Asín-Achá, Roberto

“…•New “Anytime” Framework for Automatic Algorithm Selection.•Application of the Anytime Automatic Algorithm Selection Framework to Knapsack.•3 Machine Learning…”
Get full text

Meta-learning-Based Model to Select Algorithm for Capacitated Vehicle Routing Problem by Sehta, Neha, Thakar, Urjita

Get full text

Automated Scheduling Algorithm Selection and Chunk Parameter Calculation in OpenMP by Mohammed, Ali, Korndorfer, Jonas H. Muller, Eleliemy, Ahmed, Ciorba, Florina M.

“…Increasing node and cores-per-node counts in supercomputers render scheduling and load balancing critical for exploiting parallelism. OpenMP applications can…”
Get full text

An Exploratory Landscape Analysis-Based Benchmark Suite by Lang, Ryan Dieter, Engelbrecht, Andries Petrus

“…The choice of which objective functions, or benchmark problems, should be used to test an optimization algorithm is a crucial part of the algorithm selection…”
Get full text

SimAS: A simulation‐assisted approach for the scheduling algorithm selection under perturbations by Mohammed, Ali, Ciorba, Florina M.

“…Summary Many scientific applications consist of large and computationally intensive loops. Dynamic loop self‐scheduling (DLS) techniques are used to…”
Get full text