5595 search results - page 181 / 1119 » Approximation Algorithms for Clustering Problems |
151
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
187
click to vote
SPAA
2010
ACM
15 years 10 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
146
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
190
click to vote
KDD
2002
ACM
16 years 5 months ago
2002
ACM
This paper studies the problem of categorical data clustering, especially for transactional data characterized by high dimensionality and large volume. Starting from a heuristic m...
150
click to vote
ISLPED
2007
ACM
15 years 6 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...