14 papers · ranked by Valyu relevance
Mohammad Abdur Rob, Md. Zakir Hossen, Md. Kamal Hossen, Md. Mithun Ali + 2 more
Sorting algorithms play a crucial role in computing, but most are designed with rigid structure that are only efficient under certain conditions. Although some sorting algorithms perform well in some circumstances, they do not perform well on some resistant platforms. This study introduces Wall-L Merge Sort, which…
Sunde Wang, Beilei Yin, Pu Wang, Zihao Cheng + 1 more
To address the inherent limitations of the traditional Animated Oat Optimization Algorithm (AOO), including poor uniformity of initial random population distribution and insufficient dynamic balance between global exploration and local exploitation, this paper proposes an Enhanced Animated Oat Optimization Algorithm…
Hriday Jain, Ketan Sabale, Aditya Shastri, Hiren Kumar Thakkar + 1 more
Sorting is a foundational primitive in modern data processing, influencing the execution speed of high-performance data pipelines. However, the algorithmic landscape is currently bifurcated by a pervasive "Stability Tax": practitioners must sacrifice either order preservation for high throughput or execution speed for…
Ken Kennedy, Iman Evazzade
In this paper, we examine the use of self-stabilizing algorithms, operating in a hierarchical manner, to determine intellectual property risks at a macro level. We are both interested in finding a solution that will support all defined intellectual property dimensions as well as suboptimal solutions in order to…
Samar Awad, Marwa Gamal, Khaled Abd El Salam, Rehab F. Abdel-Kader
With the rapid advancement of fog-cloud computing, task offloading and workflow scheduling have become pivotal in determining system performance and cost efficiency. To address the inherent complexity of this heterogeneous environment, a novel hybrid optimization strategy is introduced, integrating the Improved…
Daniel Anker Hermansen
In the Euclidean travelling salesman problem (Euclidean TSP), a salesman must visit $n$ points in Euclidean space, while minimizing the travel distance, according to the Euclidean distance function. In online Euclidean TSP, introduced by Abrahamsen, Bercea, Beretta, Klausen and Kozma [ESA 2024], the points are revealed…
Mohammed Alaa Ala’anzy, Nurdaulet Tolendi, Baizhan Baubek, Abdulmohsen Algarni + 1 more
Sorting can be approached in two main ways: sequentially and in parallel. In sequential sorting, data is processed in a single-threaded manner, which can be slow for large datasets. However, parallel sorting divides the task across multiple processing units, enabling faster results by processing data simultaneously.…
Jianxin Li, Ruchun Jia, Ning Xiang, Yizhun Tian
Introduction Traditional operation and maintenance decision algorithms often ignore the analysis of data source security, making them highly susceptible to noise, time-consuming in execution, and lacking in rationality. Methods In this study, we design an automated operation and maintenance decision algorithm based on…
Broderick Crawford, Hugo Caballero, Gino Astorga, Felipe Cisternas-Caneo + 7 more
The Set Covering Problem is a fundamental NP-hard problem in combinatorial optimization and plays a central role in a wide range of industrial decision-making processes, including logistics planning, scheduling, facility location, network design, and resource allocation. In many real-world contexts, problems of this…
Yuzhuo Wang, Chengzhi Zhang, Min Song, Seong Deok Kim + 2 more
Algorithms have become central to scientific research in the era of artificial intelligence (AI). Although algorithm mentions in papers are often used to indicate popularity and influence, existing studies usually evaluate individual algorithms in isolation and pay limited attention to the collective influence formed…
Alistair Benford, Per Kristian Lehre
Due to their complex dynamics, combinatorial games are a key test case and application for algorithms that train game playing agents. Among those algorithms that train using self-play are coevolutionary algorithms (CoEAs). However, the successful application of CoEAs for game playing is difficult due to pathological…
Pietro Braione, Giovanni Denaro, Luca Gugliemo, Elson Kurian + 2 more
Context. Since the eighties, the combination of program analysis techniques has been increasingly recognized as a promising approach to overcome the limitations of standalone methods. While individual techniques, based on either static or dynamic analysis, address important challenges in software dependability, their…
Akshaya Raj, Jindrich Brablik, Radana Vilimkova Kahankova, Rene Jaros + 5 more
This paper presents a comparative analysis of five popular population-based algorithms in the field of non-invasive fetal electrocardiogram (NI-fECG) extraction: (1) artificial bee colony (ABC), (2) gray wolf optimization (GWO), (3) moth flame optimization (MFO), (4) particle swarm optimization (PSO), and (5) whale…
Azadeh Farzan, Umang Mathur
Predictive runtime monitoring asks whether an execution $σ$ of a concurrent program can be used to \emph{soundly predict} the existence of a reordering $ρ$ of $σ$ that satisfies a property $\varphi$. Its effectiveness and efficiency depend on two factors: (a) the complexity of $\varphi$, and (b) the expressive power of…