Sciweavers

70 search results - page 1 / 14
» Tractability Results in the Block Algebra
Sort
View
LOGCOM
2002
55views more  LOGCOM 2002»
13 years 5 months ago
Tractability Results in the Block Algebra
In this paper we define the notion of a block algebra, which is based upon a spatial application of Allen's interval algebra. In the
Philippe Balbiani, Jean-François Condotta, ...
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
13 years 6 months ago
Blocking parameterizations for improving the computational tractability of affine disturbance feedback MPC problems
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...
Frauke Oldewurtel, Ravi Gondhalekar, Colin Neil Jo...
DM
2008
61views more  DM 2008»
13 years 5 months ago
Inheritance of hyper-duality in imprimitive Bose-Mesner algebras
We prove the following result concerning the inheritance of hyper-duality by block and quotient Bose-Mesner algebras associated with a hyper-dual pair of imprimitive Bose-Mesner a...
Brian Curtin
ICALP
2007
Springer
13 years 11 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
CP
2003
Springer
13 years 10 months ago
An Algebraic Approach to Multi-sorted Constraints
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
Andrei A. Bulatov, Peter Jeavons