In this paper the concept of later waiting time distributions for patterns in multi-state trials is generalized to cover a collection of compound patterns that must all be counted...
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...
Abstract. There exist several simple representations of uncertainty that are easier to handle than more general ones. Among them are random sets, possibility distributions, probabi...
We consider the generalized on-line two-server problem in which at each step each server receives a request, which is a point in a metric space. One of the servers has to be moved ...
A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai position...