Sciweavers

13214 search results - page 2604 / 2643
» Pseudorandomness for network algorithms
Sort
View
GG
2004
Springer
14 years 29 days ago
Workshop on Graph-Based Tools
Graphs are well-known, well-understood, and frequently used means to depict networks of related items. They are successfully used as the underlying mathematical concept in various ...
Tom Mens, Andy Schürr, Gabriele Taentzer
ICSOC
2004
Springer
14 years 29 days ago
An OGSA-based accounting system for allocation enforcement across HPC centers
In this paper, we present an Open Grid Services Architecture (OGSA)-based decentralized allocation enforcement system, developed with an emphasis on a consistent data model and ea...
Thomas Sandholm, Peter Gardfjäll, Erik Elmrot...
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 29 days ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
WCW
2004
Springer
14 years 28 days ago
ShortCuts: Using Soft State to Improve DHT Routing
Distributed hash tables are increasingly being proposed as the core substrate for content delivery applications in the Internet, such as cooperative Web caches, Web index and sear...
Kiran Tati, Geoffrey M. Voelker
CCGRID
2003
IEEE
14 years 27 days ago
Scheduling Distributed Applications: the SimGrid Simulation Framework
— Since the advent of distributed computer systems an active field of research has been the investigation of scheduling strategies for parallel applications. The common approach...
Arnaud Legrand, Loris Marchal, Henri Casanova
« Prev « First page 2604 / 2643 Last » Next »