Problems from various domains can be modeled as dynamic constraint satisfaction problems, where the constraints, the variables or the variable domains change overtime. The aim, when solving this kind of problems, is to decrease the number of variables for which their assignment changes between consecutive problems, a concept known as distance or stability. This problem of stability has previuosly been studied, but only for variations in the constraints of a given problem. This paper describes a wider analysis on the stability problem, when modifying variables, domains, constraints and combinations of these elements for the resource allocation problem, modeled as a DCSP. Experiments and results are presented related to efficiency, distance and a new parameter called global stability for several techniques such as solution reuse, reasoning reuse and a combination of both. Additionaly, results show that the distance behavior is linear with respect to the variations.
展开▼
