82 citations · 247 across the 54 of their papers we have counts for
5 papers · 1 filter
A Learning Search Algorithm for the Restricted Longest Common Subsequence Problem
Marko Djukanović, Jaume Reixach, Ana Nikolikj +3
This paper addresses the Restricted Longest Common Subsequence (RLCS) problem, an extension of the well-known Longest Common Subsequence (LCS) problem. This problem has significant…
Instance Selection for Dynamic Algorithm Configuration with Reinforcement Learning: Improving Generalization
Carolin Benjamins, Gjorgjina Cenikj, Ana Nikolikj +3
Dynamic Algorithm Configuration (DAC) addresses the challenge of dynamically setting hyperparameters of an algorithm for a diverse set of instances rather than focusing solely on i…
A Survey of Features Used for Representing Black-box Single-objective Continuous Optimization
Gjorgjina Cenikj, Ana Nikolikj, Gašper Petelin +3
This survey examines key advancements in designing features to represent optimization problem instances, algorithm instances, and their interactions within the context of single-ob…
Generalization Ability of Feature-based Performance Prediction Models: A Statistical Analysis across Benchmarks
Ana Nikolikj, Ana Kostovska, Gjorgjina Cenikj +2
This study examines the generalization ability of algorithm performance prediction models across various benchmark suites. Comparing the statistical similarity between the problem…
Quantifying Individual and Joint Module Impact in Modular Optimization Frameworks
Ana Nikolikj, Ana Kostovska, Diederick Vermetten +2
This study explores the influence of modules on the performance of modular optimization frameworks for continuous single-objective black-box optimization. There is an extensive var…