: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Abstract—The barrier coverage model was proposed for applications in which sensors are deployed for intrusion detection. In this paper, we study a strong barrier coverage problem...
Abstract. As one simple type of statistical inference problems we consider Most Likely Solution problem, a task of finding a most likely solution (MLS in short) for a given proble...
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...