Now showing items 1-5 of 266

    • Evaluating data linkage algorithms with perfect synthetic ground truth 

      Dalton, Thomas Stanley (2022-06-15) - Thesis
      Data linkage algorithms join datasets by identifying commonalities between them. The ability to evaluate the efficacy of different algorithms is a challenging problem that is often overlooked. If incorrect links are made ...
    • Sensorimotor interfaces : towards enactivity in HCI 

      Carson, Iain (University of St Andrews, 2022-06-15) - Thesis
      This thesis explores the application of enactive techniques to human computer interaction, focusing on how devices following ‘sensorimotor’ principles can be blended with interface goals to lead to new perceptual ...
    • Automatically exploiting high-level problem structure in local-search 

      Attieh, Saad (University of St Andrews, 2021-11-30) - Thesis
      Constraint Programming is the study of modelling and solving complex combinatorial problems. Systematic-search and local-search are both well-researched approaches to solving constraint problems. Systematic-search ...
    • Streamlined constraint reasoning : an automated approach from high level constraint specifications 

      Spracklen, Patrick (2022-11-29) - Thesis
      Constraint Programming (CP) is a powerful technique for solving large-scale combinatorial (optimisation) problems. Solving a problem proceeds in two distinct phases: modelling and solving. Effective modelling has a huge ...
    • Homeostatic action selection for simultaneous multi-tasking 

      Symons, David Andrew (University of St Andrews, 2020-07-29) - Thesis
      Mobile robots are rapidly developing and gaining in competence, but the potential of available hardware still far outstrips our ability to harness. Domain-specific applications are most successful due to customised ...