Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Generic filtering algorithms for generic global constraints
RISE, Swedish ICT, SICS.
2003 (English)Conference paper, Published paper (Refereed)
Abstract [en]

In a first phase, this talk presents an extension of the framework for classifying global constraints that was introduced in 2000. This is concretely illustrated by showing how constraints like alldifferent, cumulative, cutset, cycle, diffn, element, global cardinality, lexicographic ordering, soft alldifferent, or stretch fit into this framework. In a second phase, this talk motivates the need for generic filtering algorithms from different viewpoints. Finally it gives some preliminary hints of how such generic algorithms could be developed.

Place, publisher, year, edition, pages
2003, 1.
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-22394OAI: oai:DiVA.org:ri-22394DiVA, id: diva2:1041939
Conference
ERCIM Working Group on Constraints Workshop, 30 June - 2 July 2003, Budapest, Hungary
Note

Invited talk.

Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-01-14Bibliographically approved

Open Access in DiVA

No full text in DiVA

By organisation
SICS
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 11 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.33.0