995 search results - page 197 / 199 » Minimizing Congestion in General Networks |
SPAA
2003
ACM
14 years 28 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
INFOCOM
1997
IEEE
13 years 12 months ago
1997
IEEE
We consider the multiplexing of several variable bit rate (VBR) connections over one variable bit rate connection where the multiplexing uses a multiplexing bu er of size B. The V...
CCS
2006
ACM
13 years 11 months ago
2006
ACM
In trust negotiation and other distributed proving systems, networked entities cooperate to form proofs that are justified by collections of certified attributes. These attributes...
EDBT
2010
ACM
13 years 9 months ago
2010
ACM
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...