Sciweavers

478 search results - page 17 / 96
» Diameter and Center Computations in Networks
Sort
View
80
Voted
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
15 years 1 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
ICSOC
2004
Springer
15 years 2 months 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...
IPPS
1998
IEEE
15 years 1 months ago
Randomized Routing and PRAM Emulation on Parallel Machines
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
David S. L. Wei
SIGUCCS
2000
ACM
15 years 1 months ago
Creating a Help Center from Scratch: A Recipe for Success
Creating a university Help Center from scratch can be a challenging yet very rewarding experience for an IT professional. Buying computers, building networks, and installing softw...
Patrick McKoen
EENERGY
2010
15 years 1 months ago
Statistical static capacity management in virtualized data centers supporting fine grained QoS specification
From an ecological but also from an economical and in the meantime a technical view the fast ongoing increase of power consumption in today’s data centers is no longer feasible....
Marko Hoyer, Kiril Schröder, Wolfgang Nebel