default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAna Nikolikj
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Ana Nikolikj, Ana Kostovska, Gjorgjina Cenikj, Carola Doerr, Tome Eftimov:
Generalization Ability of Feature-Based Performance Prediction Models: A Statistical Analysis Across Benchmarks. CEC 2024: 1-8- [c11]Ana Nikolikj, Ana Kostovska, Diederick Vermetten, Carola Doerr, Tome Eftimov:
Quantifying Individual and Joint Module Impact in Modular Optimization Frameworks. CEC 2024: 1-8 - [c10]Ana Nikolikj
, Tome Eftimov:
Comparing Solvability Patterns of Algorithms across Diverse Problem Landscapes. GECCO Companion 2024: 143-146 - [c9]Carolin Benjamins, Gjorgjina Cenikj, Ana Nikolikj, Aditya Mohan, Tome Eftimov, Marius Lindauer:
Instance Selection for Dynamic Algorithm Configuration with Reinforcement Learning: Improving Generalization. GECCO Companion 2024: 563-566 - [i11]Ana Nikolikj, Ana Kostovska, Diederick Vermetten, Carola Doerr, Tome Eftimov:
Quantifying Individual and Joint Module Impact in Modular Optimization Frameworks. CoRR abs/2405.11964 (2024) - [i10]Ana Nikolikj, Ana Kostovska, Gjorgjina Cenikj, Carola Doerr, Tome Eftimov:
Generalization Ability of Feature-based Performance Prediction Models: A Statistical Analysis across Benchmarks. CoRR abs/2405.12259 (2024) - [i9]Gjorgjina Cenikj, Ana Nikolikj, Gasper Petelin, Niki van Stein, Carola Doerr, Tome Eftimov:
A Survey of Meta-features Used for Automated Selection of Algorithms for Black-box Single-objective Continuous Optimization. CoRR abs/2406.06629 (2024) - [i8]Carolin Benjamins, Gjorgjina Cenikj, Ana Nikolikj, Aditya Mohan, Tome Eftimov, Marius Lindauer:
Instance Selection for Dynamic Algorithm Configuration with Reinforcement Learning: Improving Generalization. CoRR abs/2407.13513 (2024) - [i7]Marko Djukanovic, Jaume Reixach, Ana Nikolikj, Tome Eftimov, Aleksandar Kartelj, Christian Blum:
A Learning Search Algorithm for the Restricted Longest Common Subsequence Problem. CoRR abs/2410.12031 (2024) - 2023
- [c8]Ana Kostovska, Gjorgjina Cenikj, Diederick Vermetten, Anja Jankovic, Ana Nikolikj, Urban Skvorc, Peter Korosec, Carola Doerr, Tome Eftimov:
PS-AAS: Portfolio Selection for Automated Algorithm Selection in Black-Box Optimization. AutoML 2023: 11/1-17 - [c7]Ana Nikolikj, Michal Pluhacek, Carola Doerr, Peter Korosec, Tome Eftimov:
Sensitivity Analysis of RF+clust for Leave-One-Problem-Out Performance Prediction. CEC 2023: 1-8 - [c6]Ana Nikolikj, Carola Doerr, Tome Eftimov:
RF+clust for Leave-One-Problem-Out Performance Prediction. EvoApplications@EvoStar 2023: 285-301 - [c5]Ana Nikolikj, Gjorgjina Cenikj, Gordana Ispirova, Diederick Vermetten, Ryan Dieter Lang, Andries Petrus Engelbrecht, Carola Doerr, Peter Korosec, Tome Eftimov:
Assessing the Generalizability of a Performance Predictive Model. GECCO Companion 2023: 311-314 - [c4]Ana Nikolikj, Saso Dzeroski, Mario Andrés Muñoz, Carola Doerr, Peter Korosec, Tome Eftimov:
Algorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances. GECCO 2023: 529-537 - [i6]Ana Nikolikj, Carola Doerr, Tome Eftimov:
RF+clust for Leave-One-Problem-Out Performance Prediction. CoRR abs/2301.09524 (2023) - [i5]Ana Nikolikj, Michal Pluhacek, Carola Doerr, Peter Korosec, Tome Eftimov:
Sensitivity Analysis of RF+clust for Leave-one-problem-out Performance Prediction. CoRR abs/2305.19375 (2023) - [i4]Ana Nikolikj, Gjorgjina Cenikj, Gordana Ispirova, Diederick Vermetten, Ryan Dieter Lang, Andries Petrus Engelbrecht, Carola Doerr, Peter Korosec, Tome Eftimov:
Assessing the Generalizability of a Performance Predictive Model. CoRR abs/2306.00040 (2023) - [i3]Ana Nikolikj, Saso Dzeroski, Mario Andrés Muñoz, Carola Doerr, Peter Korosec, Tome Eftimov:
Algorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances. CoRR abs/2306.00479 (2023) - [i2]Ana Kostovska, Gjorgjina Cenikj, Diederick Vermetten, Anja Jankovic, Ana Nikolikj, Urban Skvorc, Peter Korosec, Carola Doerr, Tome Eftimov:
PS-AAS: Portfolio Selection for Automated Algorithm Selection in Black-Box Optimization. CoRR abs/2310.10685 (2023) - 2022
- [c3]Ana Nikolikj, Ryan Dieter Lang, Peter Korosec, Tome Eftimov:
Explaining Differential Evolution Performance Through Problem Landscape Characteristics. BIOMA 2022: 99-113 - [c2]Ana Nikolikj, Risto Trajanov, Gjorgjina Cenikj, Peter Korosec, Tome Eftimov:
Identifying minimal set of Exploratory Landscape Analysis features for reliable algorithm performance prediction. CEC 2022: 1-8 - [c1]Risto Trajanov, Ana Nikolikj, Gjorgjina Cenikj, Fabien Teytaud, Mathurin Videau, Olivier Teytaud, Tome Eftimov, Manuel López-Ibáñez, Carola Doerr:
Improving Nevergrad's Algorithm Selection Wizard NGOpt Through Automated Algorithm Configuration. PPSN (1) 2022: 18-31 - [i1]Risto Trajanov, Ana Nikolikj, Gjorgjina Cenikj, Fabien Teytaud, Mathurin Videau, Olivier Teytaud, Tome Eftimov, Manuel López-Ibáñez, Carola Doerr:
Improving Nevergrad's Algorithm Selection Wizard NGOpt through Automated Algorithm Configuration. CoRR abs/2209.04412 (2022)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:08 CET 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:
