1021 search results - page 113 / 205 » Fast Approximate PCPs |
138
click to vote
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
111
click to vote
NIPS
2003
15 years 4 months ago
2003
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
115
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
In this paper, we present several descent methods that can be applied to nonnegative matrix factorization and we analyze a recently developped fast block coordinate method. We als...
113
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
128
click to vote
CORR
2002
Springer
15 years 2 months ago
2002
Springer
Mutual information is widely used in artificial intelligence, in a descriptive way, to measure the stochastic dependence of discrete random variables. In order to address question...