uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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
Design and implementation of bounded-length sequence variables
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (ASTRA)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (ASTRA)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (ASTRA)
KTH Royal Institute of Technology, Stockholm, Sweden.
2017 (English)In: Integration of AI and OR Techniques in Constraint Programming, 2017, p. 51-67Conference paper, Published paper (Refereed)
Abstract [en]

We present the design and implementation of bounded length sequence (BLS) variables for a CP solver. The domain of a BLS variable is represented as the combination of a set of candidate lengths and a sequence of sets of candidate characters. We show how this representation, together with requirements imposed by propagators, affects the implementation of BLS variables for a copying CP solver, most importantly the closely related decisions of data structure, domain restriction operations, and propagation events. The resulting implementation outperforms traditional bounded-length string representations for CP solvers, which use a fixed-length array of candidate characters and a padding symbol.

Place, publisher, year, edition, pages
2017. p. 51-67
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 10335
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-334654DOI: 10.1007/978-3-319-59776-8_5ISI: 000434086200005ISBN: 978-3-319-59775-1 (print)OAI: oai:DiVA.org:uu-334654DiVA, id: diva2:1160259
Conference
CPAIOR 2017, June 5–8, Padua, Italy
Funder
Swedish Research Council, 2015-4910Available from: 2017-05-31 Created: 2017-11-25 Last updated: 2018-11-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Scott, Joseph D.Flener, PierrePearson, Justin

Search in DiVA

By author/editor
Scott, Joseph D.Flener, PierrePearson, Justin
By organisation
Computing Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 36 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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