50 search results - page 10 / 10 » Analysis of Approximation Algorithms for k-Set Cover Using F... |
ATAL
2008
Springer
13 years 6 months ago
2008
Springer
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
WWW
2009
ACM
14 years 5 months ago
2009
ACM
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
The rapid e-commerce growth has made both business community and customers face a new situation. Due to intense competition on the one hand and the customer's option to choose...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract— High-speed wireless communication technology (e.g. WiMAX) makes it feasible and cost-effective to build wireless back-hauls for Internet access. Compared to wired count...