ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2606.15830· 20 results

cs.NEEmpiricalRecentJun 8, 2026

Quantitative Performance Analysis of Stopping Criteria for CMA-ES

Ryoji Tanabe

This paper investigates the effectiveness of stopping criteria in the CMA-ES optimization algorithm.

View →
cs.CCq-bio.QMRecentJun 1, 2026

Structure-Informed Multiple Sequence Alignment: A Formal Model and Hardness Results

Yoshiki Kanazawa, Naphan Benchasattabuse, Michal Hajdušek, Rodney Van Meter

The paper formally models structure-informed multiple sequence alignment (MSA-S) as an NP-complete optimization problem, establishing a strong computational complexity baseline for the field.

View →
cs.NEcs.CEmath.OCEmpiricalRecentOct 19, 2026

Hybrid metaheuristics for architectural design optimization under small evaluation and wall-clock budgets

Luciano Ambrosini

This paper proposes two hybrid metaheuristics and a budget-aware delay of population-size reduction to optimize architectural and structural design in parametric software.

View →
cs.NEEmpiricalRecentJul 24, 2026

Sensitivity of hMPA to Controlled CEC 2017 Transformations

Grzegorz Sroka, Sławomir T. Wierzchoń

The paper introduces a parameterized implementation to analyze the effects of bias, shift, and rotation on the Marine Predators Algorithm using the CEC 2017 benchmark.

View →
cs.NEEmpiricalRecentJul 18, 2026

Hybrid Augmented Lagrangian Method for General Constrained Optimization via Evolutionary Algorithms

Lampros Printzios, Konstantinos Chatzilygeroudis

This paper proposes a Hybrid Augmented Lagrangian (HyAL) method that integrates the constraint-handling strengths of the AL framework with the exploratory power of population-based search.

View →
cs.DBcs.IREmpiricalRecentOct 30, 2026

Fidelity Synopses: Pre-Execution Plan Selection for Approximate Vector Search

Adithya Ramanatha, Sanskar S. Singh, Maya Ramanath

This paper proposes a synopsis-guided approach to optimize vector search in databases by predicting the fidelity of different configurations and selecting the most cost-effective one for each query.

View →
cs.NEcs.AIEmpiricalRecentJun 10, 2026

SPEA2$^+$: Improved Density Estimation in SPEA2 with Provable Runtime Guarantees

Duc-Cuong Dang, Andre Opris, Dirk Sudholt

The paper conducts a runtime analysis of the Strength Pareto Evolutionary Algorithm 2 (SPEA2) and proposes an improved variant, SPEA2$^+$, to address its limitations in handling dominated solutions.

View →
cs.NEEmpiricalRecentJun 26, 2026

DE-2LS: Differential Evolution with Late-Stage local-search for Unconstrained Single-Objective Numerical Optimization

Dikshit Chauhan

This paper introduces DE-2LS, a late-stage, local-search-enhanced differential evolution framework for unconstrained single-objective optimization with variable bounds.

View →
cs.NEcs.AIcs.LGEmpiricalRecentJun 22, 2026

Evolutionary Optimization Reveals Structural Constraints on Reservoir Architecture for Spatiotemporal Chaos

Nima Dehghani

This paper uses evolutionary optimization to improve reservoir computing for prediction tasks and reveals structural constraints on the recurrent substrate.

View →
cs.NEEmpiricalRecentJul 1, 2026

From Consistency to Collaborative Discovery: MFEA-CoD for Multitask Novelty Search

Jiao Liu, Yanchi Li, Hua Yu, Abhishek Gupta +1 more

This paper proposes a multifactorial evolutionary algorithm with collaborative discovery (MFEA-CoD) for multitask novelty search, which coordinates multiple tasks to collaboratively discover novel sol…

View →
cs.NEcs.MAEmpiricalRecentJun 26, 2026

MMAO: A Metabolic Multi-Agent Optimizer with Endogenous Resource Allocation for Continuous and Discrete Optimization

Jinliang Xu, Liping Ma

This paper introduces the Metabolic Multi-Agent Optimizer (MMAO), a self-calibrating optimization framework with endogenous resource allocation for continuous and discrete problems.

View →
cs.AIRecentMay 28, 2026

Structure-Induced Information for Rerooting Levin Tree Search

Jake Tuero, Michael Buro, Laurent Orseau, Levi H. S. Lelis

The paper introduces a learned 'rerooter' mechanism to improve subgoal-based policy tree search, allowing scalable search in complex environments without the overhead of explicit subgoal generation.

View →
cs.NEEmpiricalRecentJun 26, 2026

DE-2LS: Differential Evolution with Lightweight Late Local Search for Constrained Numerical Optimization

Dikshit Chauhan, Anupam Trivedi

This paper proposes DE-2LS, a late-stage, locally search-enhanced variant of differential evolution that improves the exploitation capability of the RDEx-based search framework while preserving its sp…

View →
cs.NEcs.AIRecentJun 3, 2026

Multi-Column RBF Neural Network Using Adaptive and Non-Adaptive Particle Swarm Optimization

Ammar Hoori, Yuichi Motai

The paper proposes two novel multi-column RBFN architectures, MC-PSO and MC-APSO, that combine parallel RBFN structures with swarm optimization to significantly outperform existing methods in accuracy…

View →
cs.NEcs.AIcs.CESurveyRecentJul 10, 2026

Evolutionary Intelligence for Scientific Discovery: From Evolutionary Computation to Cumulative Discovery Systems

Chao Wang, Lingling Li, Fang Liu, Licheng Jiao

This paper proposes Evolutionary Intelligence (EI) for scientific discovery, which links candidate refinement with experience retention across evolutionary cycles.

View →