2924 search results - page 558 / 585 » Lower Bounds in Distributed Computing |
SPAA
2003
ACM
14 years 27 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...
SPAA
2003
ACM
14 years 27 days ago
2003
ACM
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...
ISORC
2000
IEEE
14 years 1 days ago
2000
IEEE
The Air Force has enthusiastically endorsed, at its most senior levels, advanced thinking with regard to the application of information technology. Recently, the notion of a Joint...
ICDCS
1999
IEEE
13 years 12 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
ICDCS
1997
IEEE
13 years 12 months ago
1997
IEEE
Connection Admission Control (CAC) is needed in ATM networks to provide Quality of Service (QoS) guarantees to real-time connections. This paper presents a CAC scheme based on a b...