52 search results - page 8 / 11 » Network design arc set with variable upper bounds |
IPPS
2000
IEEE
14 years 25 days ago
2000
IEEE
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explici...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
Several research efforts as well as deployments have chosen IEEE 802.11 as a low-cost, long-distance access technology to bridge the digital divide. In this paper, we consider the...
NOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— In this paper, we discuss a real-time on-chip communication service with a priority-based wormhole switching policy. A novel off-line schedulability analysis approach i...
SIAMDM
2010
13 years 3 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
HM
2007
Springer
14 years 2 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...