3894 search results - page 354 / 779 » Approximation Algorithms for Biclustering Problems |
148
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we propose a policy gradient reinforcement learning algorithm to address transition-independent Dec-POMDPs. This approach aims at implicitly exploiting the locality...
165
click to vote
FOCS
2007
IEEE
16 years 14 days ago
2007
IEEE
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
138
click to vote
ISSAC
2007
Springer
16 years 8 days ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
138
click to vote
SIGECOM
2005
ACM
15 years 11 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
176
click to vote
IJFCS
2006
15 years 6 months ago
2006
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...