4894 search results - page 643 / 979 » The Guarding Problem - Complexity and Approximation |
138
click to vote
PDP
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same...
135
click to vote
EMMCVPR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
135
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
132
click to vote
WAOA
2004
Springer
15 years 9 months ago
2004
Springer
A prevailing feature of mobile telephony systems is that the location of a mobile user may be unknown. Therefore, when the system has to establish a call between users, it may nee...
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...