TCS
2002
13 years 4 months ago
2002
We describe a general automata-theoretic approach for analyzing the veri
TCS
2002
13 years 4 months ago
2002
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
TCS
2002
13 years 4 months ago
2002
This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined...
TCS
2002
13 years 4 months ago
2002
Under the hypothesis that NP has positive p-dimension, we prove that any approximation algorithm A for MAX3SAT must satisfy at least one of the following:
TCS
2002
13 years 4 months ago
2002
TCS
2002
13 years 4 months ago
2002
In this article, we consider unsupervised learning from the point of view of applying neural computation on signal and data analysis problems. The article is an introductory surve...
TCS
2002
13 years 4 months ago
2002
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
TCS
2002
13 years 4 months ago
2002
Suppose a principal in a cryptographic protocol creates and transmits a message containing a new value v, later receiving v back in a different cryptographic context. It can concl...
TCS
2002
13 years 4 months ago
2002
TCS
2002
13 years 4 months ago
2002
In this paper we study a process algebra whose semantics is based on true concurrency. In our model, actions are defined in terms of the resources they need to execute, which allo...