350 search results - page 46 / 70 » Lower and upper bounds on obtaining history independence |
117
click to vote
INFOCOM
1998
IEEE
15 years 4 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
MFCS
1995
Springer
15 years 3 months ago
1995
Springer
Let ≤r and ≤s be two binary relations on 2N which are meant as reducibilities. Let both relations be closed under finite variation (of their set arguments) and consider the un...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Motivated by random linear network coding, we study the communication through channels, called linear operator channels (LOCs), that perform linear operation over finite fields. Fo...
TROB
2008
14 years 11 months ago
2008
We address discrete-time pursuit-evasion games in the plane where every player has identical sensing and motion ranges restricted to closed discs of given sensing and stepping rad...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
The growing reliance on services provided by software applications places a high premium on the reliable and efficient operation of these applications. A number of these applicat...