Sciweavers

2410 search results - page 99 / 482
» Multiset Ordering Constraints
Sort
View
153
Voted
SLP
1994
121views more  SLP 1994»
15 years 6 months ago
CLP(Intervals) Revisited
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
Frédéric Benhamou, David A. McAllest...
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 5 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
15 years 8 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
143
Voted
IWSSD
2000
IEEE
15 years 9 months ago
Design Guidance through the Controlled Application of Constraints
We seek to facilitate development of high quality software designs and architectures by using rigorous process definitions to guide application of the complex structure of relati...
Aaron G. Cass, Leon J. Osterweil
ICCAD
2001
IEEE
126views Hardware» more  ICCAD 2001»
16 years 1 months ago
Constraint Satisfaction for Relative Location Assignment and Scheduling
Tight data- and timing constraints are imposed by communication and multimedia applications. The architecture for the embedded processor imply resource constraints. Instead of ran...
Carlos A. Alba Pinto, Bart Mesman, Jochen A. G. Je...