We compare the expressive power of two automata-based finite-state models of concurrency. We show that Droste’s and Kuske’s coherent stably concurrent automata and Bednarczyk...
This paper describes the Bar-Ilan system participating in the Recognising Textual Entailment Challenge. The paper proposes first a general probabilistic setting that formalizes th...
In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the sa...
Despite the progress made in Ubiquitous Computing since it was first envisaged back in 1987 [1], its use is still isolated to the research community. In this paper, we present why...
Considering the characteristics of biological sequence databases, which typically have a small alphabet, a very long length and a relative small size (several hundreds of sequences...