10997 search results - page 130 / 2200 » On the Structure of Complete Sets |
144
click to vote
STACS
2007
Springer
16 years 9 days ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
156
click to vote
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
166
click to vote
LPNMR
2004
Springer
15 years 11 months ago
2004
Springer
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
205
click to vote
IPCV
2008
15 years 7 months ago
2008
Minimum spanning tree algorithms have been proposed for the lossy compression of image sets. In these algorithms, a complete graph is constructed from the entire image set and an ...
132
click to vote
MCSS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract Limited capacity of communication channels has brought to the attention of many researchers the analysis of control systems subject to a quantized input set. In some funda...