Project MAC: Recent submissions

Now showing items 28-30 of 176

    • On Lower Bounds for Selection Problems 

      Yao, Foong Frances (1974-03)
      Let V i (n) be the minimum number of binary comparisons that are required to determine the i-th largest of n elements drawn from a totally ordered set. In this thesis we use adversary strategies to prove lower bounds on ...

    • Analysis of Asynchronous Concurrent Systems by Timed Petri Nets 

      Ramchandani, Chander (1974-02)
      This thesis is concerned with the modeling and performance analysis of systems which consist of concurrently acting components, an example of which is an asynchronous pipelined processor. The work is divided into two ...

    • An Abstract Model of a Research Institute: Simple Automatic Programming Approach 

      Briabrin, Victor (1974-03)
      A problem of knowledge representation is considered in terms of designing a model for a simple sociological structure. A version of the access language is proposed which is based on three kind of expressions accepted by ...