Sciweavers

145 search results - page 15 / 29
» BQP and the Polynomial Hierarchy
Sort
View
SIAMCO
2008
96views more  SIAMCO 2008»
14 years 9 months ago
Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control constraints and cost are all described by...
Jean B. Lasserre, Didier Henrion, Christophe Prieu...
FSTTCS
2010
Springer
14 years 7 months ago
Determining the Winner of a Dodgson Election is Hard
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...
Michael R. Fellows, Bart M. P. Jansen, Daniel Loks...
ICDT
2011
ACM
242views Database» more  ICDT 2011»
14 years 1 months ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu
ECAI
2008
Springer
14 years 11 months ago
Test Generation for Model-Based Diagnosis
This article formalises the dual problem to model-based diagnosis (MBD), i.e., generating tests to isolate multiple simultaneous faults. Using a standard propositional MBD framewo...
Gregory M. Provan
79
Voted
ICLP
2004
Springer
15 years 3 months ago
On Programs with Linearly Ordered Multiple Preferences
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...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir