331 search results - page 47 / 67 » Using Redundant Constraints for Refinement |
AI
2006
Springer
13 years 7 months ago
2006
Springer
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...
XSYM
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We propose a mapping from the Enhanced Entity Relationship conceptual model to the W3C XML Schema Language with the following properties: information and integrity constr...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
A new technique is presented for mosaicing sparselyoverlapping image sets, with a target application of assisting the diagnosis and treatment of retinal diseases. The geometric im...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
IFM
2009
Springer
14 years 2 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...