Sciweavers

385 search results - page 7 / 77
» constraints 1999
Sort
View
ISCAS
1999
IEEE
86views Hardware» more  ISCAS 1999»
13 years 11 months ago
An algorithm for the verification of timing diagrams realizability
In this paper, we present a new method for verifying the realizability of a timing diagram with linear timing constraints, thus ensuring that the implementation of the underlying ...
A. El-Aboudi, El Mostapha Aboulhamid
ISCAS
1999
IEEE
72views Hardware» more  ISCAS 1999»
13 years 11 months ago
Shape-based sequential machine analysis
In this paper, the problem of determining if a given sequential specification can be made to fit a predetermined set of shape constraints is explored. Shape constraints are constr...
A. Crews, F. Brewer
IJCAI
1997
13 years 9 months ago
Constraint Satisfaction over Connected Row Convex Constraints
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...
Yves Deville, Olivier Barette, Pascal Van Hentenry...
LICS
1999
IEEE
13 years 11 months ago
Entailment of Atomic Set Constraints is PSPACE-Complete
The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constra...
Joachim Niehren, Martin Müller, Jean-Marc Tal...
CAD
1999
Springer
13 years 7 months ago
Geometric constraint satisfaction using optimization methods
The numerical approach to solving geometric constraint problems is indispensable for building a practical CAD system. The most commonly-used numerical method is the Newton
Jian-Xin Ge, Shang-Ching Chou, Xiao-Shan Gao