14158 search results - page 354 / 2832 » Generalized switch-setting problems |
163
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
126
click to vote
SIAMJO
2010
14 years 11 months ago
2010
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In ...
150
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
179
click to vote
PODS
2012
ACM
13 years 7 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
121
click to vote
ISPDC
2007
IEEE
15 years 11 months ago
2007
IEEE
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...