Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/200931
Title: GIFT: A Generic Interface for Reusing Filtering Algorithms
Authors: Ng, Ka Boon
Choi, Chui Wo
Henz, Martin 
Muller, Tobias 
Issue Date: Sep-2000
Citation: Ng, Ka Boon, Choi, Chui Wo, Henz, Martin, Muller, Tobias (2000-09). GIFT: A Generic Interface for Reusing Filtering Algorithms. ScholarBank@NUS Repository.
Abstract: Many dierent constraint programming (CP) systems exist today. For each CP system, there are many dierent ltering algorithms. Researchers and developers usually choose a CP system of their choice to implement their ltering algorithms. To use these ltering algorithms on another system, we have to port the code over. This situation is clearly not desirable. In this paper, we propose a generic C++ interface for writing ltering algorithms called GIFT (Generic Interface for FilTers). By providing the generic interface on dierent CP systems, we can reuse any ltering algorithms easily. A case study on reusing scheduling ltering algorithms between Mozart and Figaro further highlights the feasibility of this approach.
URI: https://scholarbank.nus.edu.sg/handle/10635/200931
Appears in Collections:Staff Publications
Elements

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
gift.pdf9.76 MBAdobe PDF

OPEN

Post-printView/Download

Page view(s)

24
checked on Dec 2, 2021

Download(s)

6
checked on Dec 2, 2021

Google ScholarTM

Check


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