Implementing Tuple Variables in Gecode
Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
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.
Engineering and Technology
IdentifiersURN: urn:nbn:se:uu:diva-291321OAI: oai:DiVA.org:uu-291321DiVA: diva2:925287
Bachelor Programme in Computer Science
Flener, PierreGällmo, Olle