Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
Cellular automata are usually updated synchronously and thus deterministically. The question of stochastic dynamics arises in the development of cellular automata resistant to nois...
Scheduling time impact on system performance increases especially when using dynamic priority algorithms, because of the enlarged computational effort at runtime. This overhead ca...
Jens Hildebrandt, Frank Golatowski, Dirk Timmerman...
Abstract-- This paper proposes a deterministic observer design for visual tracking based on non-parametric implicit (level-set) curve descriptions. The observer is continuous-discr...
Marc Niethammer, Patricio A. Vela, Allen Tannenbau...