Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorKlos, T.
dc.contributor.authorHuijting, C.A.A.
dc.date.accessioned2018-09-04T17:01:02Z
dc.date.available2018-09-04T17:01:02Z
dc.date.issued2018
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/30929
dc.description.abstractA great number of problems, like scheduling shifts in a hospital, or dividing up resources for manufacturing, can be reduced to a problem called Constraint Satisfaction Problem (CSP). These CSPs make use of constraints placed on variables to determine if a problem can be satisfied. In this thesis, the effect of ordering variables on a backtracking algorithm used to solve a CSP will be explored. A number of graphs used to model a CSP problem will be solved, dynamically changing the order of the agents in between every run. Results found indicated a decline in median number of edges in the order of agents as they ranked from a high priority to a lower priority, as well as a reduced number of backtracks required on a lower decay rate. Conclusively, the order of agents seems to matter with respect to the median number of edges per agent, but where the decay rate barely has any influence on the median number of edges, they do greatly influence the number of backtracks required.
dc.description.sponsorshipUtrecht University
dc.format.extent221713
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleDynamic ordering between Asynchronous Backtracking algorithms
dc.type.contentBachelor Thesis
dc.rights.accessrightsOpen Access
dc.subject.courseuuKunstmatige Intelligentie


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record