52 search results - page 8 / 11 » Network design arc set with variable upper bounds |
113
Voted
IPPS
2000
IEEE
15 years 7 months 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...
124
click to vote
WWW
2007
ACM
16 years 4 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...
121
click to vote
NOCS
2008
IEEE
15 years 9 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...
140
Voted
SIAMDM
2010
14 years 10 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 ...
118
click to vote
HM
2007
Springer
15 years 9 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 ⊆...