IndexBrowse   BibliographiesMy selection
 Search: in   (word length ≥ 3)
      Login
Reference no #1028   Download bibtex file Type :   Html | Bib | Both
    Created: 2007-12-12 11:31:20
1028 Add to my selection
Ka Boon Ng, Chiu Wo Choi, Martin Henz and Tobias Müller. GIFT: A Generic Interface for Reusing Filtering Algorithms. In N. Beldiceanu, W. Harvey, Martin Henz, F. Laburthe, E. Monfroy, Tobias Müller, L. Perron and Christian Schulte editors, Workshop on Techniques for Implementing Constraint Programming Systems (TRICS), September, Pages 86-100, Singapore, 2000. URL [Abstract] [Annote]
@InProceedings{Ng_et_al:2000,
      AUTHOR = {Ng, Ka Boon and Choi, Chiu Wo and Henz, Martin and Müller, Tobias},
      TITLE = {GIFT: A Generic Interface for Reusing Filtering Algorithms},
      YEAR = {2000},
      BOOKTITLE = {Workshop on Techniques for Implementing Constraint Programming Systems (TRICS), September},
      PAGES = {86-100},
      EDITOR = {Beldiceanu, N. and Harvey, W. and Henz, Martin and Laburthe, F. and Monfroy, E. and Müller, Tobias and Perron, L. and Schulte, Christian},
      ADDRESS = {Singapore},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/KaboonChoiHenzMueller00a.ps.gz},
      ABSTRACT = {Many different constraint programming (CP) systems exist today. For each CP system, there are many different filtering algorithms. Researchers and developers usually choose a CP system of their choice to implement their filtering algorithms. To use these filtering 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 filtering algorithms called GIFT (Generic Interface for FilTers). By providing the generic interface on different CP systems, we can reuse any filtering algorithms easily. A case study on reusing scheduling filtering algorithms between Mozart and Figaro further highlights the feasibility of this approach.},
      ANNOTE = {COLIURL : Ng:2000:GGI.pdf Ng:2000:GGI.ps}
}
Last modified: Thu October 16 2014 19:11:34         BibAdmin