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 16-27 of 27
-
(University of Oregon, 1981-05)This manual describes the Little Big LISP system for the Z80 microcomputer. The manual describes data structures, defined functions, operating procedures, a compiler, an RLISP parser, and support packages.
-
(University of Oregon, 1991-01)This paper describes a modified form of Kohlbecker's algorithm for reliably hygienic (capture-free) macro expansion in block-structured languages, where macros are source-tos-ource transformations specified using a ...
-
(University of Oregon, 1990-01-19)In this paper, we identify the binomial tree as an ideal computation structure for parallel divide-and-conquer algorithms. We show its superiority to the classic full binary tree structure with respect to speedup and ...
-
Negotiation Behavior During Multiple Agent Specification: A Need for Automated Conflict Resolution (University of Oregon, 1989-09-06)Negotiation is part of specification. During specification acquisition, users negotiate amongst themselves and with analysts. During specification design, designers negotiate amongst themselves and with a project leader. ...
-
(University of Oregon, 1990-01-19)The mapping problem in message-passing parallel processors involves the assignment of tasks in a parallel computation to processors and the routing of inter-task messages along the links of the interconnection network. We ...
-
(University of Oregon, 1990-12-07)The Mayfly, a parallel processor being built at HP Labs in Palo Alto, has architectural support for several import.ant. aspects of the OM virtual machine for parallel logic programs. Each node has a coprocessor that is ...
-
(University of Oregon, 1988-11-17)We argue that in certain problem domains, AI planning can be viewed as a foundation for generation, critiquing, and elaboration of a specification. Two specification design projects in our group are used as a focus of ...
-
(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 16-27 of 27