566 search results - page 47 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
121
click to vote
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
178
click to vote
SAC
2006
ACM
15 years 4 months ago
2006
ACM
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
140
click to vote
AAAI
2004
15 years 5 months ago
2004
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
139
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...
131
click to vote
DSS
2007
15 years 4 months ago
2007
International crime and terrorism have drawn increasing attention in recent years. Retrieving relevant information from criminal records and suspect communications is important in...