26 papers · ranked by Valyu relevance
Authors not listed
Atomistic simulations provide essential mechanistic insights into chemical processes, yet many important phenomena in chemistry and materials science occur on timescales that are inaccessible to molecular dynamics. Existing computational approaches force a choice between atomic resolution on relatively short timescales…
Božidar Bratina, Dušan Fister, Suzana Uran, Izidor Mlakar + 4 more
Localization of a semi-humanoid mobile robot Pepper is proposed based on the particle swarm optimization algorithm (PSO) that is robust to the disturbance perturbations of LIDAR-measured distances from the mobile robot to the walls of the robot real laboratory workspace. The novel PSO, with the avoiding local minima…
Ran Wang, Weiquan Huang, Junyu Wu, Chen Chen + 3 more
To address the rapid population diversity loss and premature convergence of the Artificial Lemming Algorithm (ALA) in complex optimization problems, this paper proposes an Improved Artificial Lemming Algorithm (IALA) with multi-strategy enhancements inspired by lemming behavior. First, a non-uniform mutation operator…
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…
Han Yang, Xingwang Huang, Heming Jia
The rapid development of intelligent systems has introduced increasingly sophisticated optimization problems across diverse domains. While contemporary metaheuristic algorithms, including the recent Artificial Lemming Algorithm (ALA), have shown considerable promise, they frequently encounter difficulties such as…
Authors not listed
Machine olfaction—the artificial replication of the sense of smell—faces significant challenges due to the absence of large, standardized training datasets. Unlike vision, language, and audio models, which benefit from extensive corpora such as ImageNet, GLUE, and AudioSet, olfaction lacks scaled equivalents and…
Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
In the field of swarm robotics, one of the most studied problem is Gathering. It asks for a distributed algorithm that brings the robots to a common location, not known in advance. We consider the case of robots constrained to move along the edges of a graph under the wellknown OBLOT model. Gathering is then…
Jingyang Zhao, Mingyu Xiao
The multi-vehicle dial-a-ride problem (mDaRP) is a fundamental vehicle routing problem with pickups and deliveries, widely applicable in ride-sharing, economics, and transportation. Given a set of n locations, h vehicles of identical capacity λ located at various depots, and m ride requests each defined by a source and…
Christian Konrad, Kheeran K. Naidu, Archie Walton, Eric Wang
Assadi, Liu, and Tarjan [SOSA'21] gave an auction algorithm that outputs a $(1-ε)$-approximation to Maximum Matching in bipartite graphs. Their algorithm computes a sequence of $O(\frac{1}{ε^2})$ maximal matchings in subgraphs of the input graph and can be implemented in the multi-pass streaming setting with…
Martin Hitz, Michaela Hitz
We introduce two novel algorithms for the problem of finding the closest pair in a cloud of n points based on findings from mathematical optimal packing theory. Both algorithms are deterministic, show fast effective runtimes, and are very easy to implement. For our main algorithm, cppMM, we prove O(n) time complexity…
Zhuo Dai, Yefu Zhou, Bibhas Chandra Giri
In supply chain management, the location of facilities, inventory control, and vehicle routing are three key components. This paper incorporates a two-warehouse inventory system into the location- inventory-routing problems (LIRPs) and develops LIRP models with two warehouses in one-level, two-level, and three-level…
Maria Constantin, Adrian Miclăuş, Alexandru Popa, Andrei Popa
Given a finite set of integers $A$, a \emph{unary translocation} produces a new set $A' = A \cup \{u,v\}$, where $u$ and $v$ are nonnegative integers satisfying $x+y=u+v$ for some $x,y\in A$. For an input set $A$ and a target set $B$, the \emph{unary translocation distance} is the minimum number of unary translocations…
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…
Authors not listed
The Hidden Subgroup Problem (HSP) unifies several landmark quantum algorithms, yet systematic exploration of its variants and modern applications has slowed. This paper revives HSP-based algorithm design by examining new group structures with direct relevance to post-quantum cryptography, lattice problems, and…
Authors not listed
Terminally labeled DNA oligonucleotides have wide applications in modern biology and biotechnological applications. It has been observed that the fluorescent intensity of light released from these fluorescent labels is heavily influenced by the terminal sequence of nucleotides. Recent studies have assayed and published…
Mingbin Tang, Yejun Zheng, Lianbao Li, Li Cao + 2 more
Complex engineering optimization problems often exhibit high-dimensional, multi-constraint, and nonlinear characteristics. Traditional deterministic optimization methods rely on gradient information and have limited optimization ranges, making it difficult to meet the requirements of efficient and accurate solutions.…
Authors not listed
Exploring the potential energy surface to sample transition state regions is crucial to understand the atomic processes that govern chemical reactivity. Ideally, the exploration does not require any collective variables that are based on prior chemical domain knowledge. With this in mind, we adapt the stochastic saddle…
Mahmudur Rahman Hera, David Koslicki, Conrado Martínez
With the surge in sequencing data generated from an ever-expanding range of biological studies, designing scalable computational techniques has become essential. One effective strategy to enable large-scale computation is to split long DNA or protein sequences into k-mers, and summarize large k-mer sets into compact…
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…
Xiaohui Bei, Ke Ding, Bo Li, Fangxiao Wang
Maximin share (MMS) stands out as a central notion in fair resource allocation. It is known that exact MMS fairness is not always attainable, especially when agents differ along two dimensions: their valuations and their perceptions of the divisibility of resources. The former case with heterogeneous valuations has…
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…
Yu Liu, Maosheng Fu, Chaochuan Jia, Zhengyu Liu + 5 more
Unmanned aerial vehicle path planning faces multiple challenges in terms of effectiveness and safety. Traditional optimization methods are difficult to use to effectively find the best route. An enhanced artificial lemming optimization algorithm (ALAEN) is proposed here, which introduces stochastic differential…
Florian Ingels, Lucas Robidou, Igor Martayan, Camille Marchet + 1 more
High-throughput sequence analysis commonly relies on k-mers (words of fixed length k) to remain tractable at modern scales. These k-mer-based pipelines can employ a sampling step, which in turn allows grouping consecutive k-mers into larger strings to improve data locality. Although other sampling strategies exist…
Authors not listed
Transition-state (TS) identification for bimolecular liquid-phase reactions is notoriously sensitive to the initial spatial arrangement of reactants, making automated searches difficult, especially in solvation where conformational effects dominate barrier heights. We address this gap with a fully automated, heuristic…
Authors not listed
The combinatorial explosion inherent to multi-component systems limits their experimental exploration and ultimately chemical discovery. Here, we introduce a statistics-based group-testing strategy, which we couple with luminescence quenching assays to efficiently identify cooperative molecular interactions. Utilizing…
Tao Hong, William R. Stauffer
Complex economic decisions are often combinatorial: they require individuals to select from many alternatives under strict constraints on time, resources, and energy. Combinatorial reasoning is the cognitive process that enables decision makers to construct and evaluate multiple potential solutions in the face of these…