Sciweavers

154 search results - page 20 / 31
» Consistency for Quantified Constraint Satisfaction Problems
Sort
View
AAAI
1996
13 years 8 months ago
Neighborhood Inverse Consistency Preprocessing
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...
Eugene C. Freuder, Charles D. Elfe
ICML
2007
IEEE
14 years 8 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner
COMPULOG
1999
Springer
13 years 11 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh
IFM
2009
Springer
14 years 2 months ago
Verifying UML/OCL Operation Contracts
In current model-driven development approaches, software models are the primary artifacts of the development process. Therefore, assessment of their correctness is a key issue to e...
Jordi Cabot, Robert Clarisó, Daniel Riera
EDBT
2012
ACM
271views Database» more  EDBT 2012»
11 years 10 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