566 search results - page 30 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
84
Voted
IFM
2009
Springer
15 years 7 months ago
2009
Springer
In current model-driven development approaches, software models are the primary artifacts of the development process. Therefore, assessment of their correctness is a key issue to e...
77
Voted
IJCAI
2001
15 years 1 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
102
Voted
SARA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
EUROMICRO
2003
IEEE
15 years 5 months ago
2003
IEEE
Software components promise easy reuse, dependability, and simplified development. Problems arise when implicit assumptions about the use of the component are encoded in the imple...
81
Voted
FLAIRS
2003
15 years 1 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...