749 search results - page 101 / 150 » Dualities for Constraint Satisfaction Problems |
85
Voted
SIAMSC
2008
14 years 11 months ago
2008
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
103
click to vote
CPAIOR
2008
Springer
15 years 25 days ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
AAAI
2004
15 years 14 days ago
2004
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
114
click to vote
STOC
2009
ACM
15 years 11 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
113
click to vote
GLOBECOM
2008
IEEE
15 years 5 months ago
2008
IEEE
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...