Now showing items 6-10 of 28

  • Constraints on parallelism beyond 10 instructions per cycle

    Cleary, John G.; Littin, Richard H.; McWha, David J.A.; Pearson, Murray W. (Computer Science, University of Waikato, 1997-11)
    The problem of extracting Instruction Level Parallelism at levels of 10 instructions per clock and higher is considered. Two different architectures which use speculation on memory accesses to achieve this level of performance ...
  • Correcting English text using PPM models

    Teahan, W.J.; Inglis, Stuart J.; Cleary, John G.; Holmes, Geoffrey (Computer Science, University of Waikato, 1997-11)
    An essential component of many applications in natural language processing is a language modeler able to correct errors in the text being processed. For optical character recognition (OCR), poor scanning quality or extraneous ...
  • Current techniques for measuring and modeling ATM traffic

    Pearson, Murray W.; Cleary, John G.; Unger, Brian; Williamson, Carey (1996-06)
    ATM has now been widely accepted as the leading contender for the implementation of broadband communications networks (Brinkmann, Lavrijsen, Louis, et al, 1995) ATM networks are no longer restricted to research laboratories, ...
  • Datalog as a parallel general purpose programming language

    Cleary, John G.; Utting, Mark; Clayton, Roger (University of Waikato, Department of Computer Science, 2010-08-27)
    The increasing available parallelism of computers demands new programming languages that make parallel programming dramatically easier and less error prone. It is proposed that datalog with negation and timestamps is a ...
  • The design of an optimistic AND-parallel Prolog

    Cleary, John G.; Olthof, Ian (University of Waikato, Department of Computer Science, 1993-10)
    A distributed AND-parallel Prolog implementation is described. The system can correctly handle all pure Prolog programs. In particular, it deals with the problem of distributed backtracking. Conflicts in variable bindings ...