1142 search results - page 59 / 229 » Approximability of Clausal Constraints |
183
click to vote
APPROX
2009
Springer
16 years 26 days ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
166
click to vote
TALG
2010
15 years 4 months ago
2010
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
164
click to vote
AAAI
1992
15 years 7 months ago
1992
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
146
click to vote
ICDM
2008
IEEE
16 years 22 days ago
2008
IEEE
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
153
click to vote
RTSS
2002
IEEE
15 years 11 months ago
2002
IEEE
Typical real-time scheduling theory has addressed deadline and energy constraints as well as deadline and reward constraints simultaneously in the past. However, we believe that e...