Algorithms, Volume 15, Issue 12

Capturing long-term statistics of signals and time series is important for modeling recurrent phenomena, especially when such recurrences are a-periodic and can be characterized by the approximate repetition of variable length motifs, such as pattern...

Unweighted Pair Group Method with Arithmetic Mean (UPGMA) is one of the most popular distance-based methods to reconstruct an equidistant phylogenetic tree from a distance matrix computed from an alignment of sequences. Since we use equidistant trees...

In this paper, the procedure of finding the coefficients of an equation to describe the thermal conductivity of refrigerants low in global warming potential (GWP) is transformed into a multi-objective optimization problem by constructing a multi-obje...

Connectivity in large-scale data center networks is a critical indicator to evaluate network state. A feasible and performance-guaranteed algorithm enables us to find disjoint paths between network vertices to ensure effective data transfer and to ma...

The evaluation of the fault diagnosis capability of a data center network (DCN) is important research in measuring network reliability. The g-extra diagnosability is defined under the condition that every component except the fault vertex set contain...

It has been proven that extended resolution (ER) has more powerful reasoning than general resolution for the pigeonhole principle in Cook’s paper. This fact indicates the possibility that a solver based on extended resolution can exceed Boolean...

The problem of wildfire spread prediction presents a high degree of complexity due in large part to the limitations for providing accurate input parameters in real time (e.g., wind speed, temperature, moisture of the soil, etc.). This uncertainty in...

Many real-world optimization problems typically involve multiple (conflicting) objectives [...]

The Theta* algorithm is a path planning algorithm based on graph search, which gives the optimal path with more flexibility than A* algorithm in terms of routes. The traditional Theta* algorithm is difficult to take into account with the global and d...

We propose an agent-based model of financial markets with only one asset. Thirty-two agents follow very simple rules inspired by Wolfram’s Rule 110. They engage in buying, selling, and/or holding. Each agent is endowed with a starting balance s...