Sciweavers

942 search results - page 78 / 189
» Distance Constraint Satisfaction Problems
Sort
View
AMAI
1999
Springer
14 years 9 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä
EDBT
2012
ACM
271views Database» more  EDBT 2012»
13 years 12 days 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
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
15 years 11 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
CONSTRAINTS
2002
107views more  CONSTRAINTS 2002»
14 years 9 months ago
Fourier Elimination for Compiling Constraint Hierarchies
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring tha...
Warwick Harvey, Peter J. Stuckey, Alan Borning
CISSE
2008
Springer
14 years 11 months ago
From Constraints to Resolution Rules Part I : conceptual framework
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Denis Berthier