503 search results - page 93 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
IMC
2003
ACM
15 years 2 months ago
2003
ACM
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
79
Voted
ILP
2004
Springer
15 years 2 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
IPPS
2008
IEEE
15 years 3 months ago
2008
IEEE
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...
SIGMOD
1997
ACM
15 years 1 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...