1299 search results - page 4 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
107
click to vote
MSS
2008
IEEE
14 years 11 months ago
2008
IEEE
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
ECCV
1992
Springer
15 years 3 months ago
1992
Springer
This paper describes the geometrical limitations of algorithms for 3D reconstruction which use corresponding line tokens. In addition to announcing a description of the general cri...
ICLP
2003
Springer
15 years 4 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
CONEXT
2007
ACM
15 years 3 months ago
2007
ACM
The distributed nature of the Internet makes it difficult for a single service provider to troubleshoot the disruptions experienced by its customers. We propose NetDiagnoser, a tr...