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
Design and implementation of bounded-length sequence variables
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
2017 (English)In: 14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, CPAIOR 2017, Springer, 2017, Vol. 10335, 51-67 p.Conference 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
Springer, 2017. Vol. 10335, 51-67 p.
Series
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743 ; 10335
National Category
Other Engineering and Technologies
Identifiers
URN: urn:nbn:se:kth:diva-210288DOI: 10.1007/978-3-319-59776-8_5Scopus ID: 2-s2.0-85020813669ISBN: 9783319597751 (print)OAI: oai:DiVA.org:kth-210288DiVA: diva2:1118219
Conference
14th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming, CPAIOR 2017, Padova, Italy, 5 June 2017 through 8 June 2017
Funder
Swedish Research Council, 2015-4910
Note

QC 20170630

Available from: 2017-06-30 Created: 2017-06-30 Last updated: 2017-06-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Schulte, Christian
By organisation
Software and Computer systems, SCS
Other Engineering and Technologies

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 5 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