1381 search results - page 65 / 277 » Computational Complexity of Constraint Satisfaction |
175
click to vote
PODS
1999
ACM
15 years 8 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
126
click to vote
AUTOMATICA
2010
15 years 3 months ago
2010
: The guarantee of feasibility given feasibility at initial time is an issue that has been overlooked by many of the recent papers on stochastic model predictive control. Effective...
138
click to vote
KR
2004
Springer
15 years 9 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
139
click to vote
SARA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
122
Voted
CP
2008
Springer
15 years 5 months ago
2008
Springer
Constraints that are defined by tables of allowed tuples of assignments are common in constraint programming. In this paper we present an approach to reformulating table constraint...