Browsing Computer and Information Science Faculty Research by Title

Navigation

Display Options

Results

  • Lo, Virginia M.; Pall, Gurdeep Singh (University of Oregon, 1991-01)
    We propose a simple extension to Gantt charts, called RAGA scores, for use in distributed real time scheduling. RAGA scores use a small set of symbols borrowed from musical notation to enrich the expressive power of the ...
  • Mata-Montero, Erick (University of Oregon, 1990-06-08)
    Recent developments in graph theory have shown the importance of the class of partial k- trees. This large class of graphs admits several algorithm design methodologies that render efficient solutions for a large number ...
  • Mata-Montero, Erick (University of Oregon, 1989-10-20)
    The resilience of a network is the expected number of pairs of nodes that can communicate. Computing the resilience of a network has been shown to be a #P-complete problem for planar networks and to take O(n)^2 time for ...
  • Mata-Montero, Erick (University of Oregon, 1989-10-20)
    The resilience of a network is the expected number of pairs of nodes that can communicate. Computing the resilience of a network is a #P-complete problem even for planar networks with fail-safe nodes. We generalize an ...
  • Clinger, William D.; Rees, Jonathan (University of Oregon, 2004-10)
    The report gives a defining description of the programming language Scheme. Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy Lewis Steele Jr. and Gerald Jay ...

Search Scholars' Bank


Advanced Search

Browse

My Account

Statistics