1760 search results - page 128 / 352 » Connected Set Cover Problem and Its Applications |
133
click to vote
ICLP
2004
Springer
15 years 10 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
174
click to vote
FOSSACS
2007
Springer
15 years 8 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
125
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
155
Voted
JNW
2006
15 years 5 months ago
2006
Tracking of mobile targets is an important application of sensor networks. This is a non-trivial problem as the increased accuracy of tracking results in an overall reduction in th...
137
click to vote
EMNLP
2010
15 years 3 months ago
2010
Unknown words are a hindrance to the performance of hand-crafted computational grammars of natural language. However, words with incomplete and incorrect lexical entries pose an e...