Premium
The DeltaUp constraint solver: minimizing the number of method selections in DeltaBlue
Author(s) -
Suzuki Tetsuya,
Tokuda Takehiro
Publication year - 2001
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.421
Subject(s) - solver , constraint (computer aided design) , computer science , constraint satisfaction problem , mathematical optimization , function (biology) , local consistency , algorithm , mathematics , artificial intelligence , geometry , evolutionary biology , probabilistic logic , biology
We present a modification of the DeltaBlue constraint solver called DeltaUp. DeltaBlue is an incremental constraint solver based on local propagation, which is widely used for constructing graphical user interfaces and algorithm animations. DeltaUp minimizes the number of time‐consuming tasks of DeltaBlue, namely method selections, in each planning phase. To compute the exact number of needed method selections, we introduced a cost function up‐cost to DeltaBlue. Our benchmarks show that DeltaUp is approximately two times faster than DeltaBlue in the best case. Even in the worst case, it is only slightly slower than DeltaBlue. Copyright © 2001 John Wiley & Sons, Ltd.