601 search results - page 45 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
112
click to vote
CP
2000
Springer
15 years 5 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
113
click to vote
EOR
2008
15 years 1 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
112
click to vote
IWPC
2000
IEEE
15 years 5 months ago
2000
IEEE
This paper presents a framework for software architecture recovery and restructuring. The user specifies a high level abstraction view of the system using a structured pattern la...
121
click to vote
ICDE
2010
IEEE
15 years 1 months ago
2010
IEEE
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
146
click to vote
SEBD
2001
15 years 2 months ago
2001
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...