7015 search results - page 296 / 1403 » Approximation algorithms for co-clustering |
185
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
178
click to vote
JCO
2010
15 years 5 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
176
click to vote
JCSS
2011
15 years 1 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
138
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
We show that linear value-function approximation is equivalent to a form of linear model approximation. We then derive a relationship between the model-approximation error and the...
211
click to vote
IPCO
2008
15 years 8 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...