FCS
2006
13 years 5 months ago
2006
: Many of the Internet's problems are related to names. There are many empirical ideas of the further development of naming on the Internet. However, there are no theoretical ...
FCS
2006
13 years 5 months ago
2006
: We introduce an extended model for view-centric reasoning, EVCR, that provides more nsive and flexible abstractions for representing actual concurrency. The theory of Communicati...
FCS
2006
13 years 5 months ago
2006
: In this paper, functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Although different systems in...
FCS
2006
2006
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
13 years 5 months ago
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
FCS
2006
13 years 5 months ago
2006
FCS
2006
13 years 5 months ago
2006
FCS
2006
13 years 5 months ago
2006
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
FCS
2006
13 years 5 months ago
2006
FCS
2006
13 years 5 months ago
2006
By far the most important automated tool for network and communications security is encryption, but encryption itself needs security. As we know, many cryptosystems and cryptograp...
FCS
2006
13 years 5 months ago
2006
This paper is based on the idea that the Church-Turing-Deutsch (CTD) principle can play a very fundamental role in Physics similar to those of conservation laws in the constructio...