23 search results - page 3 / 5 » Optimal Solution of the Maximum All Request Path Grooming Pr... |
TPDS
2008
13 years 5 months ago
2008
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...
TIP
1998
13 years 5 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
MFCS
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
IOR
2007
13 years 5 months ago
2007
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...