Change search
ReferencesLink to record
Permanent link

Direct link
Implementing Tuple Variables in Gecode
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2016 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

In constraint programming, efficient pruning is vital to avoid unnecessary search. This thesis shows that tuple variables can be used to reduce the size of the search tree, which in turn may reduce the execution time. The tuple variables have been implemented in C++ for the Gecode library. The problem used to measure performance is finding paths through a deterministic finite automaton with transition costs.

Place, publisher, year, edition, pages
2016. , 27 p.
IT, 16020
National Category
Engineering and Technology
URN: urn:nbn:se:uu:diva-291321OAI: diva2:925287
Educational program
Bachelor Programme in Computer Science
Available from: 2016-05-01 Created: 2016-05-01 Last updated: 2016-05-01Bibliographically approved

Open Access in DiVA

fulltext(519 kB)53 downloads
File information
File name FULLTEXT01.pdfFile size 519 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 53 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: 1218 hits
ReferencesLink to record
Permanent link

Direct link