Now showing items 51-55 of 297

    • A more effective use of information in search for quantified Boolean formulae 

      Rowley, Andrew G. D. (University of St Andrews, 2006) - Thesis
      The solving of Quantified Boolean Formulae (QBFs) has recently become of great interest. QBFs are an extension of the Satisfiability problem (SAT), which has been studied in depth. Many QBF techniques are built as extensions ...
    • An implementation of Reeve's syntax directed translator 

      Vashishta, Ambrish (University of St Andrews, 1978) - Thesis
      This thesis describes an implementation of a syntax-directed translator originally due to C.M. Reeves. The translator program simulates a special-purpose stored-program digital computer. A program for this machine represents ...
    • A syntax analysis and manipulation tool 

      Milne, Allan C. (University of St Andrews, 1986) - Thesis
      A software system for analysing and manipulating an LL(1) grammar of a programming language is described. An extended form of BNF notation is presented for the specification of the syntax. The transformations which can be ...
    • Non-analytic shifts in smooth goal-directed human behaviour 

      Wale, Adrian Peter (University of St Andrews, 2006) - Thesis
      The thesis is aimed at finding the form of explanation and creating the associated computing methodology required to provide an effective computational explanation of smooth goal-directed behaviour. Smooth behaviour has ...
    • Multisite adaptive computation offloading for mobile cloud applications 

      Sulaiman, Dawand Jalil (University of St Andrews, 2020-12-01) - Thesis
      The sheer amount of mobile devices and their fast adaptability have contributed to the proliferation of modern advanced mobile applications. These applications have characteristics such as latency-critical and demand high ...