7930 search results - page 705 / 1586 » Greedy in Approximation Algorithms |
235
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
194
click to vote
ICASSP
2011
IEEE
14 years 11 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
181
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
317
click to vote
VLDB
2009
ACM
16 years 7 months ago
2009
ACM
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
170
click to vote
ATAL
2009
Springer
16 years 2 months ago
2009
Springer
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...