7930 search results - page 188 / 1586 » Greedy in Approximation Algorithms |
157
click to vote
FOCS
2006
IEEE
16 years 15 days ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
193
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
We propose two algorithms for Q-learning that use the two-timescale stochastic approximation methodology. The first of these updates Q-values of all feasible state
182
click to vote
APPROX
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
178
click to vote
ISAAC
1998
Springer
15 years 10 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
143
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...