Sciweavers

Share
AAAI
2012
6 years 8 months ago
A Dichotomy for 2-Constraint Forbidden CSP Patterns
Novel tractable classes of the binary CSP (constraint satisfaction problem) have recently been discovered by studying classes of instances defined by excluding subproblems descri...
Martin C. Cooper, Guillaume Escamocher
EDBT
2012
ACM
271views Database» more  EDBT 2012»
6 years 8 months ago
Towards a decentralised hierarchical architecture for smart grids
We present a hierarchical distributed communication and control architecture for Smart Grids. The proposed topology consists of multiple layers to allow for robust and flexible d...
Daniel Rech, Andreas Harth
LICS
2012
IEEE
6 years 8 months ago
Near Unanimity Constraints Have Bounded Pathwidth Duality
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
Libor Barto, Marcin Kozik, Ross Willard
CP
2011
Springer
7 years 6 months ago
Hierarchically Nested Convex VCSP
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
Martin C. Cooper, Stanislav Zivny
CP
2011
Springer
7 years 6 months ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Nic Wilson, Walid Trabelsi
DEBS
2011
ACM
7 years 9 months ago
Declarative data-driven coordination
Many data-driven social and Web applications involve collaboration and coordination. The vision of declarative data-driven coordination (D3C), proposed in [9], is to support coord...
Johannes Gehrke
ICTAI
2009
IEEE
8 years 3 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux
ICPPW
2009
IEEE
8 years 3 months ago
Global Multiprocessor Real-Time Scheduling as a Constraint Satisfaction Problem
In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction proble...
Liliana Cucu-Grosjean, Olivier Buffet
CP
2010
Springer
8 years 4 months ago
Including Ordinary Differential Equations Based Constraints in the Standard CP Framework
Coupling constraints and ordinary differential equations has numerous applications. This paper shows how to introduce constraints involving ordinary differential equations into the...
Alexandre Goldsztejn, Olivier Mullier, Damien Evei...
LATIN
2010
Springer
8 years 4 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen
books