1941 search results - page 349 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
CCO
2001
Springer
15 years 2 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
RECSYS
2009
ACM
15 years 4 months ago
2009
ACM
Short search engine queries do not provide contextual information, making it difficult for traditional search engines to understand what users are really requesting. One approach ...
SIGCOMM
2005
ACM
15 years 3 months ago
2005
ACM
IP anycast, with its innate ability to find nearby resources in a robust and efficient fashion, has long been considered an important means of service discovery. The growth of P2...
MOBICOM
2012
ACM
13 years 6 days ago
2012
ACM
GPS is one of the most widely used wireless systems. A GPS receiver has to lock on the satellite signals to calculate its position. The process of locking on the satellites is qui...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we study the media workload collected from a large number of commercial Web sites hosted by a major ISP and that collected from a large group of home users connecte...