7006 search results - page 1026 / 1402 » Approximation Algorithms |
150
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
205
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, whic...
159
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
182
click to vote
IJWIN
2006
15 years 6 months ago
2006
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
215
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...