Index Catalog // ScholarsArchive@OSU

Creator:: Oregon State University. Dept. of Computer Science and Bayer, Valentina
Abstract:: "The specifi c problem addressed in this proposal is the development of good approximation algorithms for solving problems that have partial observability. The model we propose associates costs with obtaining information about the current state. We want to predict when and how much it is necessary to observe. We want...
Resource Type:: Research Paper
Full Text:: Decision Processes Ph.D. Proposal Department of Computer Science Oregon State University Valentina

Creator:: Oregon State University. Dept. of Computer Science and Cull, Paul, 1943-
Abstract:: "Fifty years after the pioneering work of McCulloch and Pitts, the study of neural nets is alive and active. In this paper, I have discussed some of the work that is of current interest to me and my co-workers. I would, perhaps, be remiss if I failed to mention some...
Resource Type:: Research Paper
Full Text:: model Paul Cull 96-20-01 February, 1996 Department of Computer Science Oregon State University

Creator:: Oregon State University. Dept. of Computer Science and Moore, Jason Andrew
Abstract:: Brief descriptions of the I/O requirements for four production oceanography programs running at Oregon State University are presented. The applications all rely exclusively on array-oriented, sequential file operations. Persistent files are used for checkpointing and movie making, while temporary files are used to store out-of-core data.
Resource Type:: Research Paper
Full Text:: Jason A. Moore Department of Computer Science Oregon State University Corvallis, Oregon 97331-3202

Creator:: Oregon State University. Dept. of Computer Science and Cull, Paul, 1943-
Abstract:: This note briefly discusses some of the classical results of McCulloch and Pitts. It then deals with some current research in neural nets. Several questions about neural nets are shown to be computationally difficult by showing that they are NP-Complete or worse. The size of neural nets necessary to compute...
Resource Type:: Research Paper
Full Text:: Department of Computer Science Oregon State University Corvallis, Oregon USA 97331{3202 pc@cs.orst.edu

Creator:: Oregon State University. Dept. of Computer Science and Budd, Timothy
Abstract:: The lambda calculus has frequently been used as an intermediate representation for programming languages, particularly for functional programming language systems. We introduce two simple extensions to the lambda calculus that describe potentially parallel computations. These extensions permit us to use the lambda calculus as an intermediate form for languages that...
Resource Type:: Research Paper
Full Text:: Expressions Timothy A. Budd Department of Computer Science Oregon State University Corvallis, Oregon

Creator:: Oregon State University. Dept. of Computer Science and Budd, Timothy
Abstract:: Multiparadigm programming is a term used to describe a style of software development that makes use of facilities originally designed in support of a number of different programming language paradigms. In this paper we illustrate our conception of multiparadigm programming, by describing how various data structures can be implemented in...
Resource Type:: Research Paper
Full Text:: of Computer Science Oregon State University Corvallis, Oregon 97331 budd@cs.orst.edu September

Creator:: Oregon State University. Dept. of Computer Science and Budd, Timothy
Abstract:: A generalized arithmetic package allows a programmer to think of numbers as abstract quantities, without regard to whether they are represented as integers, floating point values, fractions, complex numbers, or even polynomials. In this paper we describe two implementation techniques that can be used to produce a generalized arithmetic package...
Resource Type:: Research Paper
Full Text:: Computer Science Oregon State University Corvallis, Oregon 97331 budd@cs.orst.edu July 10, 1998

Creator:: Oregon State University. Dept. of Computer Science and Budd, Timothy
Abstract:: This paper describes features of a new strongly typed, compiled programming language, called LEDA. LEDA attempts to combine aspects of both imperative (value-oriented) and logical (relation-oriented) styles of programming. Logical behavior is introduced by means of a new programming structure, called a relation. Relations have similarities to functions and procedures,...
Resource Type:: Research Paper
Full Text:: � Timothy A. Budd Department of Computer Science Oregon State University Corvallis, Oregon 97331 budd

Creator:: Oregon State University. Dept. of Computer Science and Budd, Timothy
Abstract:: Functional programming languages, such as Backus' FP, and high level expression oriented languages, such as APL, are examples of programming languages in which the primary method of program construction is the process of composition. In this paper we describe an approach to generating code for languages based on compositions. The...
Resource Type:: Research Paper
Full Text:: Timothy A. Budd Department of Computer Science Oregon State University Corvallis, Oregon 97331 budd

Creator:: Oregon State University. Dept. of Computer Science and Budd, Timothy
Abstract:: In an earlier paper we developed an intermediate representation for languages based on composition, and showed how the representation could facilitate generating code for functional languages, such as FP. In this paper we follow the same philosophical approach, using instead the applicative language APL. Further, we show how this intermediate...
Resource Type:: Research Paper
Full Text:: Languages Timothy A. Budd Department of Computer Science Oregon State University Corvallis, Oregon

ScholarsArchive@OSU