1040 search results - page 170 / 208 » Rounding algorithms for covering problems |
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
70
Voted
MOBICOM
2004
ACM
15 years 3 months ago
2004
ACM
—The traffic load of wireless LANs is often unevenly distributed among the access points (APs), which results in unfair bandwidth allocation among users. We argue that the load ...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
– In this paper, we proposed an improved algorithm for the multi-robot complete coverage problem. Real world applications such as lawn mowing, chemical spill clean-up, and humani...
75
Voted
WEBI
2004
Springer
15 years 3 months ago
2004
Springer
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...