JavaScript is disabled for your browser. Some features of this site may not work without it.
Scholars' Bank will
be on a content freeze from 9/6 - 9/16 as we transition to a new & improved version. Minimal downtime expected
on 9/16. Stay tuned for more updates!
Browsing Department of Computer and Information Science by Title
Navigation
Display Options
Results
Now showing items 23-27 of 27
-
(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 ...
-
(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 ...
-
(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 ...
-
(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 ...
-
(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 ...
Now showing items 23-27 of 27