Please use this identifier to cite or link to this item: https://doi.org/10.1007/3-540-45578-7_17
Title: Components for state restoration in tree search
Authors: Choi, CW
Henz, M 
Ng, KB
Issue Date: 1-Jan-2001
Publisher: Springer Berlin Heidelberg
Citation: Choi, CW, Henz, M, Ng, KB (2001-01-01). Components for state restoration in tree search 2239 : 240-255. ScholarBank@NUS Repository. https://doi.org/10.1007/3-540-45578-7_17
Abstract: Constraint programming systems provide software architectures for the fruitful interaction of algorithms for constraint propagation, branching and exploration of search trees. Search requires the ability to restore the state of a constraint store. Today’s systems use different state restoration policies. Up ward restoration undoes changes using a trail, and downward restoration (recomputation) reinstalls information along a downward path in the search tree. In this paper, we present an architecture that isolates the state restoration policy as an orthogonal software component. Applications of the architecture include two novel state restoration policies, called lazy copying and batch recomputation, and a detailed comparison of these and existing restoration policies with “everything else being equal”. The architecture allows the user to optimize the time and space consumption of applications by choosing existing and designing new state restoration policies in response to application-specific characteristics.
URI: https://scholarbank.nus.edu.sg/handle/10635/200929
ISBN: 3540428631
9783540428633
ISSN: 03029743
16113349
DOI: 10.1007/3-540-45578-7_17
Appears in Collections:Staff Publications
Elements

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
components.pdf218.87 kBAdobe PDF

OPEN

Post-printView/Download

SCOPUSTM   
Citations

10
checked on Nov 29, 2021

Page view(s)

21
checked on Dec 2, 2021

Download(s)

1
checked on Dec 2, 2021

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.