Now showing items 864-883 of 1364

  • Observational models of requirements evolution 

    Felici, Massimo (The University of Edinburgh, 2004)
  • On a Question of H. Friedman 

    Plotkin, Gordon (ACADEMIC PRESS INC, 1996)
    In this paper we answer a question of Friedman, providing an ω-separable model M of the λβη-calculus. There therefore exists an α-separable model for any α≥0. The model M permits no non-trivial enrichment as a partial ...
  • On a thermodynamic approach to biomolecular interaction networks 

    Honorato-Zimmer, Ricardo (The University of Edinburgh, 2017-11-30)
    We explore the direct and inverse problem of thermodynamics in the context of rule-based modelling. The direct problem can be concisely stated as obtaining a set of rewriting rules and their rates from the description ...
  • On approximating the stochastic behaviour of Markovian process algebra models 

    Milios, Dimitrios (The University of Edinburgh, 2014-06-27)
    Markov chains offer a rigorous mathematical framework to describe systems that exhibit stochastic behaviour, as they are supported by a plethora of methodologies to analyse their properties. Stochastic process algebras ...
  • On bisimulation and model-checking for concurrent systems with partial order semantics 

    Gutierrez, Julian (The University of Edinburgh, 2011-06-30)
    In concurrency theory—the branch of (theoretical) computer science that studies the logical and mathematical foundations of parallel computation—there are two main formal ways of modelling the behaviour of systems where ...
  • On combining collaborative and automated curation for enzyme function prediction 

    De Ferrari, Luna Luciana (The University of Edinburgh, 2012-11-29)
    Data generation has vastly exceeded manual annotation in several areas of astronomy, biology, economy, geology, medicine and physics. At the same time, a public community of experts and hobbyists has developed around ...
  • On Functors Expressible in the Polymorphic Typed Lambda Calculus 

    Plotkin, Gordon; Reynolds, John (Information and Computation, 1991)
    Given a model of the polymorphic typed lambda calculus based upon a Cartesian closed category K, there will be functors from K to K whose action on objects can be expressed by type expressions and whose action on morphisms ...
  • On hereditary Harrop formulae as a basis for logic programming 

    Harland, James (The University of Edinburgh, 1991)
  • On probabilistic inference approaches to stochastic optimal control 

    Rawlik, Konrad Cyrus (The University of Edinburgh, 2013-11-28)
    While stochastic optimal control, together with associate formulations like Reinforcement Learning, provides a formal approach to, amongst other, motor control, it remains computationally challenging for most practical ...
  • On Process Equivalence = Equation Solving in CCS 

    Bundy, Alan; Monroy, Raul; Green, Ian (Springer, 2009-06)
    Unique Fixpoint Induction (UFI) is the chief inference rule to prove the equivalence of recursive processes in the Calculus of Communicating Systems (CCS) (Milner 1989). It plays a major role in the equational approach to ...
  • On the complexity of evaluating multivariate polynomials 

    Jerrum, Mark (The University of Edinburgh, 1981)
  • On the Distribution of Control in Asynchronous Processor Architectures 

    Rebello, Vinod (University of Edinburgh. College of Science and Engineering. School of Informatics., 1997-07)
    The effective performance of computer systems is to a large measure determined by the synergy between the processor architecture, the instruction set and the compiler. In the past, the sequencing of information within ...
  • On the efficiency of meta-level inference 

    Harmelen, Frank van (The University of Edinburgh, 1989)
    In this thesis we will be concerned with a particular type of architecture for reasoning systems, known as meta-level architectures. After presenting the arguments for such architectures (chapter 1), we discuss a number ...
  • On the Mutability of Protocols 

    McGinnis, Jarred P (University of Edinburgh. College of Science and Engineering. School of Informatics., 2006-06)
    The task of developing a framework for which agents can communicate reliably and flexibly in open systems is not trivial. This thesis addresses the dichotomy between reliable communication and facilitation of the autonomy ...
  • On the quantitative analysis of Deep Belief Networks 

    Salakhutdinov, Ruslan; Murray, Iain (2008)
    Deep Belief Networks (DBN’s) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allowed these models to be applied successfully in ...
  • On the role of the hippocampus in the acquisition, long-term retention and semanticisation of memory 

    Gingell, Sarah M (2005)
    A consensus on how to characterise the anterograde and retrograde memory processes that are lost or spared after hippocampal damage has not been reached. In this thesis, I critically re-examine the empirical literature ...
  • On the simulation and design of manycore CMPs 

    Thompson, Christopher Callum (The University of Edinburgh, 2015-11-26)
    The progression of Moore’s Law has resulted in both embedded and performance computing systems which use an ever increasing number of processing cores integrated in a single chip. Commercial systems are now available ...
  • One Tone, Two Ears, Three Dimensions: An investigation of qualitative echolocation strategies in synthetic bats and real robots 

    Walker, Ashley (University of Edinburgh. College of Science and Engineering. School of Informatics., 1997-07)
    The aim of the work reported in this thesis is to investigate a methodology for studying perception by building and testing robotic models of animal sensory mechanisms. Much of Artificial Intelligence studies agent perception ...
  • Ontology and reuse in model synthesis 

    Biris Brilhante, Virginia (The University of Edinburgh, 2003)
  • Ontology evolution in physics 

    Chan, Michael (The University of Edinburgh, 2013-07-02)
    With the advent of reasoning problems in dynamic environments, there is an increasing need for automated reasoning systems to automatically adapt to unexpected changes in representations. In particular, the automation ...