601 search results - page 33 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
RECOMB
2004
Springer
16 years 1 months ago
2004
Springer
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
126
click to vote
EDBTW
2006
Springer
15 years 3 months ago
2006
Springer
The need for incremental constraint maintenance within collections of semi-structured documents has been ever increasing in the last years due to the widespread diffusion of XML. T...
119
click to vote
EMO
2009
Springer
15 years 8 months ago
2009
Springer
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
135
click to vote
AI
2010
Springer
15 years 1 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
128
click to vote
EAAI
2008
15 years 1 months ago
2008
: In real life scenarios there is often the need for modelling conditional plans where external events determgine the actual execution sequence. Conditional Temporal Problems (CTPs...