Change search
ReferencesLink to record
Permanent link

Direct link
Sweep as a Generic Pruning Technique
Number of Authors: 1
2000 (English)Report (Refereed)
Abstract [en]

This report presents a generic pruning technique that aggregates several constraints sharing some variables. The method is derived from an idea called sweep that is extensively used in computational geometry. A first benefit of this technique comes from the fact that it can be applied on several families of global constraints. A second main advantage is that it does not lead to any memory consumption problem since it only requires temporary memory that can be reclaimed after each invocation of the method. This technique has been used inside the SICStus finite domain solver in order to implement several global constraints.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2000, 1. , 16 p.
Series
SICS Technical Report, ISSN 1100-3154 ; 2000:08
Keyword [en]
Global constraint, Sweep
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-22011OAI: oai:DiVA.org:ri-22011DiVA: diva2:1041553
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(119 kB)6 downloads
File information
File name FULLTEXT01.pdfFile size 119 kBChecksum SHA-512
73c01b3f33391d507b5a4d7c9cdf862371031338ecd994e68dcb9f42fd85403a1a179a98861c81a869fe4e3d8892377ae47a0289273fb20d7afe483f45956ea5
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 6 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 2 hits
ReferencesLink to record
Permanent link

Direct link