IFIP
2004
Springer
13 years 10 months ago
2004
Springer
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a rou...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
In the STS-based mapping, we are requested to obtain the correct order of probes in a DNA sequence from a given set of fragments or equivalently a hybridization matrix A. It is wel...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
The parallel packet switch (PPS) extends the inverse multiplexing architecture, and is extensively used as the core of contemporary commercial switches. A key factor in the perfor...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
Previous type systems for mobility calculi (the original Mobile Ambients, its variants and descendants, e.g., Boxed Ambients and Safe Ambients, and other related systems) offer lit...