3894 search results - page 378 / 779 » Approximation Algorithms for Biclustering Problems |
133
Voted
AOR
2007
15 years 5 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
163
Voted
CORR
2006
Springer
15 years 5 months ago
2006
Springer
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
133
click to vote
TSP
2010
14 years 11 months ago
2010
We address covariance estimation in the sense of minimum mean-squared error (MMSE) when the samples are Gaussian distributed. Specifically, we consider shrinkage methods which are ...
116
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
144
click to vote
CCCG
1994
15 years 6 months ago
1994
We formulate the problem of computing the widest empty corridor with at most ` links and right-angle turns for a set of n points. It is a generalization of the widest empty corrid...