Sciweavers

2181 search results - page 80 / 437
» The restriction scaffold problem
Sort
View
JSAT
2006
126views more  JSAT 2006»
13 years 8 months ago
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...
MST
2010
140views more  MST 2010»
13 years 7 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
ICLP
2001
Springer
14 years 1 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
UAI
2008
13 years 10 months ago
The Computational Complexity of Sensitivity Analysis and Parameter Tuning
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...
Johan Kwisthout, Linda C. van der Gaag
IPL
2010
115views more  IPL 2010»
13 years 7 months ago
Hardness and approximation of minimum distortion embeddings
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
Pinar Heggernes, Daniel Meister