:: Library Catalog

Saved in:

Bibliographic Details
Main Authors:	Djukanović, Marko, Reixach, Jaume, Nikolikj, Ana, Eftimov, Tome, Kartelj, Aleksandar, Blum, Christian
Format:	Preprint
Published:	2024
Subjects:	Artificial Intelligence
Online Access:	https://arxiv.org/abs/2410.12031
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An Adaptive CMSA for Solving the Longest Filled Common Subsequence Problem with an Application in Audio Querying
by: Djukanovic, Marko, et al.
Published: (2025)

On Solving the Multiple Variable Gapped Longest Common Subsequence Problem
by: Djukanović, Marko, et al.
Published: (2026)

A Three-Stage Algorithm for the Closest String Problem on Artificial and Real Gene Sequences
by: Abdi, Alireza, et al.
Published: (2024)

Graph Protection under Multiple Simultaneous Attacks: A Heuristic Approach
by: Djukanovic, Marko, et al.
Published: (2024)

Customized Exploration of Landscape Features Driving Multi-Objective Combinatorial Optimization Performance
by: Nikolikj, Ana, et al.
Published: (2025)

Tracing the Interactions of Modular CMA-ES Configurations Across Problem Landscapes
by: Nikolikj, Ana, et al.
Published: (2025)

Consistent and Distinctive: LLM Benchmark Efficiency via Maximum Independent Set Prompt Selection on Similarity Graphs
by: Kjorvezir, Denica, et al.
Published: (2026)

A Biased Random Key Genetic Algorithm for Solving the Longest Run Subsequence Problem
by: Blum, Christian, et al.
Published: (2025)

Quantifying the Impact of Modules and Their Interactions in the PSO-X Framework
by: Camacho-Villalón, Christian L., et al.
Published: (2026)

Comparing Optimization Algorithms Through the Lens of Search Behavior Analysis
by: Cenikj, Gjorgjina, et al.
Published: (2025)

ClustOpt: A Clustering-based Approach for Representing and Visualizing the Search Dynamics of Numerical Metaheuristic Optimization Algorithms
by: Cenikj, Gjorgjina, et al.
Published: (2025)

Geometric Learning in Black-Box Optimization: A GNN Framework for Algorithm Performance Prediction
by: Kostovska, Ana, et al.
Published: (2025)

Algorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances
by: Nikolikj, Ana, et al.
Published: (2023)

Instance Selection for Dynamic Algorithm Configuration with Reinforcement Learning: Improving Generalization
by: Benjamins, Carolin, et al.
Published: (2024)

Generalization Ability of Feature-based Performance Prediction Models: A Statistical Analysis across Benchmarks
by: Nikolikj, Ana, et al.
Published: (2024)

Quantifying Individual and Joint Module Impact in Modular Optimization Frameworks
by: Nikolikj, Ana, et al.
Published: (2024)

An Algorithm for the Longest Common Subsequence and Substring Problem for Multiple Strings
by: Li, Rao
Published: (2024)

A Survey of Meta-features Used for Automated Selection of Algorithms for Black-box Single-objective Continuous Optimization
by: Cenikj, Gjorgjina, et al.
Published: (2024)

Adaptive Estimation of the Number of Algorithm Runs in Stochastic Optimization
by: Eftimov, Tome, et al.
Published: (2025)

The Longest Increasing Subsequence Problem revisited
by: Franz, Silvio, et al.
Published: (2026)

Expected Length of the Longest Common Subsequence of Multiple Strings
by: Li, Ray, et al.
Published: (2025)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
by: Rahat, Md Tanzeem, et al.
Published: (2025)

Learning-Based Algorithms for Graph Searching Problems
by: DePavia, Adela Frances, et al.
Published: (2024)

ACT-JEPA: Novel Joint-Embedding Predictive Architecture for Efficient Policy Representation Learning
by: Vujinovic, Aleksandar, et al.
Published: (2025)

Finding Diverse Strings and Longest Common Subsequences in a Graph
by: Shida, Yuto, et al.
Published: (2024)

Improved Lower Bounds on the Expected Length of Longest Common Subsequences
by: Heineman, George T., et al.
Published: (2024)

Deterministic Longest Common Subsequence Approximation in Near-Linear Time
by: Boneh, Itai, et al.
Published: (2025)

Trilevel Memetic Algorithm for the Electric Vehicle Routing Problem
by: Milinović, Ivan, et al.
Published: (2025)

TSFM in-context learning for time-series classification of bearing-health status
by: Tokic, Michel, et al.
Published: (2025)

An Enhanced Iterative Deepening Search Algorithm for the Unrestricted Container Rehandling Problem
by: Wang, Ruoqi, et al.
Published: (2025)

Translating Federated Learning Algorithms in Python into CSP Processes Using ChatGPT
by: Popovic, Miroslav, et al.
Published: (2025)

Large Language Models for the Automated Analysis of Optimization Algorithms
by: Sartori, Camilo Chacón, et al.
Published: (2024)

Simulations of Common Unsupervised Domain Adaptation Algorithms for Image Classification
by: Chaddad, Ahmad, et al.
Published: (2025)

The Longest Common Bitonic Subsequence: A Match-Sensitive Dynamic Programming Approach
by: Rahat, Md. Tanzeem, et al.
Published: (2025)

A Heuristic Algorithm Based on Beam Search and Iterated Local Search for the Maritime Inventory Routing Problem
by: Sanghikian, Nathalie, et al.
Published: (2025)

Construct, Merge, Solve & Adapt with Reinforcement Learning for the min-max Multiple Traveling Salesman Problem
by: Rodríguez-Corominas, Guillem, et al.
Published: (2026)

irace-evo: Automatic Algorithm Configuration Extended With LLM-Based Code Evolution
by: Sartori, Camilo Chacón, et al.
Published: (2025)

Limits of Transformer Language Models on Learning to Compose Algorithms
by: Thomm, Jonathan, et al.
Published: (2024)

A Beam Search Based Parallel Algorithm for the Two-Dimensional Strip Packing Problem
by: Wen, Yajie, et al.
Published: (2025)

Temporal Action Representation Learning for Tactical Resource Control and Subsequent Maneuver Generation
by: Jung, Hoseong, et al.
Published: (2026)