425 search results - page 57 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
MIDDLEWARE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Grids are becoming more and more dynamic, running parallel applications on large scale and heterogeneous resources. Explicitly stopping a whole distributed application is...
COMCOM
1998
13 years 7 months ago
1998
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime import...
GRID
2008
Springer
13 years 7 months ago
2008
Springer
A myriad of recent activities can be seen towards dynamic workflow composition for processing complex and data intensive problems. Meanwhile, the simultaneous emergence of the gri...
WETICE
1998
IEEE
13 years 12 months ago
1998
IEEE
Proposals for multicast security that have been published so far are complex, often require trust in network components or are inefficient. In this paper we propose a series of no...