It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
MPEG, in addition to being an international standard, is currently the most popular coding scheme for stored video. For several applications that require stored video, such as vid...
Brandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the smallest real number α such that there exists an infinite word over a k-letter alphabet t...