153 search results - page 7 / 31 » An Empirical Analysis of Approximation Algorithms for Euclid... |
TSP
2008
13 years 7 months ago
2008
Abstract--This paper addresses the resolution of the conventional and noncircular MUSIC algorithms for arbitrary circular and noncircular second-order distributions of two uncorrel...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
CCS
2010
ACM
13 years 7 months ago
2010
ACM
This paper presents the first large-scale study of the success of password expiration in meeting its intended purpose, namely revoking access to an account by an attacker who has ...
WSC
2004
13 years 8 months ago
2004
We summarize the results of an experimental performance evaluation of using an empirical histogram to approximate the steady-state distribution of the underlying stochastic proces...
COR
2006
13 years 7 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...