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…
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…
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…
Shreeharsha G Bhat, Daanish Mahajan, Chirag Jain
A key application of pangenome graphs is the characterization of small and large genomic variants represented as bubbles within the graph. Although bubbles have been extensively studied in directed graphs in the context of genome assembly, there remains a need for a rigorous definition and systematic analysis of…
Anh Phong Tran, Dhruv D. Jatkar, M. Ali Al-Radhawi, Elizabeth A. Ernst + 1 more
Minimal synthesis of Boolean functions is an NP-hard problem, and heuristic approaches typically give suboptimal circuits. However, in the emergent field of synthetic biology, genetic logic designs that use even a single additional Boolean gate can render a circuit unimplementable in a cell. This has led to a renewed…
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…
Arseny Shur, Ido Tziony, Yaron Orenstein
Minimizers are sampling schemes which are ubiquitous in almost any high-throughput sequencing analysis. Assuming a fixed alphabet of size σ, a minimizer is defined by two positive integers k, w and a linear order ρ on k-mers. A sequence is processed by a sliding window algorithm that chooses in each window of length w…
Changin Oh, Kathleen P. Wilkie
We present the Toroidal Search Algorithm (TSA), a novel population-based metaheuristic optimization method inspired by the topology of a torus. Conventional metaheuristics frequently suffer from boundary stagnation, a phenomenon that severely degrades performance in bounded and high-dimensional search spaces. TSA…
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…
Jian Liu, Jianwei Zhang
Current de novo genome assembly tools often demand substantial memory resources, and their execution typically relies on high-performance computing (HPC) clusters. This dependency limits their use in resource-constrained settings. Furthermore, mainstream third-generation sequencing assembly and alignment tools usually…
Benjamin M. David, Paul A. Jensen
Coordinating multiple liquid handling robots is a complex logistical task when designing biological experiments. Protocol designers must consider the capabilities and constraints of each robot to distribute work optimally across multiple instruments. We developed an optimization framework that finds optimal liquid…