120 search results - page 21 / 24 » Randomized Lower Bounds for Online Path Coloring |
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
IOPADS
1997
13 years 9 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
SIAMCOMP
2000
13 years 7 months ago
2000
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...