CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we present a methodology and set of tools which assist the construction of applications from components, by separating the issues of transmission policy from compone...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The persistent programming systems of the 1980s offered a programming model that integrated computation and long-term storage. In these systems, reliable applications could be eng...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, following the way opened by a previous paper deposited on arXiv, see[7], we give an upper bound to the number of states for a hyperbolic cellular automaton in the pe...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We propose an univesal scheme to design loop-free and superstabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isom...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A graph G is (a, b)-choosable if for any color list of size a associated with each vertices, one can choose a subset of b colors such that adjacent vertices are colored with disjoi...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
---------------------------------------------------ABSTRACT-----------------------------------------------In the literature of Round-Robin scheduling scheme, each job is processed,...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
In this paper, subgraphs and complementary graphs are used to analyze network synchronizability. Some sharp and attainable bounds are derived for the eigenratio of the network str...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
- Structural properties of two well-known families of keystream generators, Shrinking Generators and Cellular Automata, have been analyzed. Emphasis is on the equivalenceof the bin...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Calibrated strategies can be obtained by performing strategies that have no internal regret in some auxiliary game. Such strategies can be constructed explicitly with the use of B...