No abstract

In recent years among developers of robotic software formed a direction of the development of individual solvers. Such solvers are designed for specific hard problems. In this paper we consider an approach to design of an efficient solver for the problem of placement of visual landmarks. Mathematics Subject Classification: 68T40

No abstract

No abstract

Many problems of technical vision received a lot of attention recently. In this paper, we consider the problem of monitoring of passenger flows. To solve this problem we use Haar cascades.Mathematics Subject Classification: 42C40, 65T60

In this paper, we consider the problem of the shortest common parameterized supersequence. In particular, we consider an explicit reduction from the problem to the satisfiability problem. Keywords: parameterized supersequence, satisfiability, NP-completeThe well-known problem of the shortest common supersequence (SCS) is a classical distance measure for strings. Another well-studied string comparison measure is that of parameterized matching, where two equal-length strings are a parameterized-match if there exists a bijection on the alphabets such that one string matches the other under the bijection (see e.g. [1,2]). For instance, it is considered the periodicity of parameterized strings. These results and some other studies about the periodicity of parameterized strings showed considerable differences between parameterized strings and ordinary strings.

In this paper we consider an approach to solve the minimum test collection problem. This approach is based on an explicit reduction from the problem to the satisfiability problem.

GSAT is a well-known satisfiability search algorithm which uses some random functions. In this paper, we consider an artificial physics optimization for computing a function of starting population.