4744 search results - page 808 / 949 » Connected Computing |
159
click to vote
PODC
2005
ACM
15 years 12 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
197
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
153
click to vote
AINA
2010
IEEE
15 years 11 months ago
2010
IEEE
: This paper is on failure detectors to solve the consensus problem in asynchronous systems made up of anonymous processes prone to crash and connected by asynchronous reliable cha...
172
click to vote
ICNP
2002
IEEE
15 years 11 months ago
2002
IEEE
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
156
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...