Index Catalog // ScholarsArchive@OSU

Creator:: Oregon State University. Dept. of Computer Science, Takikawa, Masami, and Crowl, Lawrence Alan, 1959-
Abstract:: Augmented term rewriting (ATR) is a simple, uniform, and extensible computational model for constraint programming. Unfortunately, ATR cannot solve combinatorial constraint satisfaction problems (CCSPs). To enable solution of CCSPs, we introduce (don't know) nondeterminism into ATR via the choice expression, which identifies a set of possible values that may satisfy...
Resource Type:: Research Paper

Creator:: Oregon State University. Dept. of Computer Science, Tadepalli, Prasad, and Ok, DoKyeong
Abstract:: In this paper, we introduce a model-based reinforcement learning method called H-learning, which optimizes undiscounted average reward. We compare it with three other reinforcement learning methods in the domain of scheduling Automatic Guided Vehicles, transportation robots used in modern manufacturing plants and facilities. The four methods differ along two dimensions....
Resource Type:: Research Paper

Creator:: Oregon State University. Dept. of Computer Science, Cull, Paul, 1943-, and Pandey, Rajeev K.
Abstract:: The N-Queens problem is commonly used to teach the programming technique of backtrack search. The N-Queens problem may also be used to illustrate the important concept of isomorphism. Here we show how the N-Queens problem can be used as a vehicle to teach the concepts of isomorphism, transformation groups or...
Resource Type:: Research Paper

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

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

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

ScholarsArchive@OSU