Sciweavers

9842 search results - page 219 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
AAAI
2006
14 years 5 days ago
Acquiring Constraint Networks Using a SAT-based Version Space Algorithm
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...
Christian Bessière, Remi Coletta, Fré...
APPROX
2004
Springer
116views Algorithms» more  APPROX 2004»
14 years 4 months ago
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
FCS
2009
13 years 8 months ago
The Importance of Symmetric Representation
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...
Thomas O'Neil
ICLP
2001
Springer
14 years 3 months ago
Fixed-Parameter Complexity of Semantics for Logic Programs
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
Zbigniew Lonc, Miroslaw Truszczynski
INFOCOM
2008
IEEE
14 years 5 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang