5595 search results - page 275 / 1119 » Approximation Algorithms for Clustering Problems |
237
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...
221
click to vote
SIGMOD
2011
ACM
14 years 10 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
231
click to vote
ACST
2006
15 years 8 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
173
Voted
KAIS
2006
15 years 7 months ago
2006
Clustering has been one of the most widely studied topics in data mining and k-means clustering has been one of the popular clustering algorithms. K-means requires several passes ...
225
click to vote
ICML
1996
IEEE
15 years 11 months ago
1996
IEEE
This paper presents a direct reinforcement learning algorithm, called Finite-Element Reinforcement Learning, in the continuous case, i.e. continuous state-space and time. The eval...