994 search results - page 6 / 199 » Custom Computing Machines for the Set Covering Problem |
CONEXT
2010
ACM
13 years 5 months ago
2010
ACM
Traditional DSL troubleshooting solutions are reactive, relying mainly on customers to report problems, and tend to be labor-intensive, time consuming, prone to incorrect resoluti...
ICCTA
2007
IEEE
14 years 2 months ago
2007
IEEE
We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
PDP
2010
IEEE
14 years 2 hour ago
2010
IEEE
The commercial success of Cloud computing and recent developments in Grid computing have brought platform virtualization technology into the field of high performance computing. Vi...
ICCNMC
2005
Springer
14 years 1 months ago
2005
Springer
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...