mirage   mirage   mirage

Browsing Technical Reports (Electrical Engineering and Computer Science) by Title

DSpace/Manakin Repository

Browsing Technical Reports (Electrical Engineering and Computer Science) by Title

Sort by: Order: Results:

  • Oregon State University. Dept. of Computer Science; Takikawa, Masami; Crowl, Lawrence Alan, 1959- (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1994-11)
    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 soluti ...
  • Gopinath, Rahul; Jensen, Carlos (Computer scientist); Groce, Alex; Oregon State University. School of Electrical Engineering and Computer Science (Corvallis, OR : School of Electrical Engineering and Computer Science, Oregon State University, 2014)
    Mutation analysis is often used to compare the effectiveness of different test suites or testing techniques. One of the main assumptions underlying this technique is the Competent Programmer Hypothesis, which proposes th ...
  • Oregon State University. School of Electrical Engineering and Computer Science; Abraham, Robin; Erwig, Martin (Corvallis, OR : Oregon State University, School of Electrical Engineering and Computer Science, 2006-08-01)
    We present a catalog of mutation operators for spreadsheets drawn from research into mutation testing for general purpose programming languages and from spreadsheet errors that have been reported in literature. These ope ...
  • Oregon State University. Dept. of Computer Science; Cull, Paul, 1943- (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1996-02)
    "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, ...
  • Oregon State University. Dept. of Computer Science; Cull, Paul, 1943- (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1995-04)
    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 ...
  • Oregon State University. Dept. of Computer Science; Budd, Timothy (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1994-09-20)
    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 ...
  • Oregon State University. Dept. of Computer Science; Beckwith, Laura A.; Inman, Derek; Rector, Kyle; Burnett, Margaret, 1949- (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2007-04)
    Although there have been a number of studies of end-user software development tasks, few of them have considered gender issues for real end-user developers in real-world environments for end-user programming. In orde ...
  • Oregon State University. Dept. of Computer Science; Moore, Jason Andrew (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1995-03)
    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. ...
  • Oregon State University. Dept. of Computer Science; Budd, Timothy (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1998-07-10)
    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 calculu ...
  • Oregon State University. Dept. of Computer Science; Cull, Paul, 1943-; Nelson, Ingrid (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1998)
    The set of codewords for a standard error-correcting code can be viewed as subset of the vertices of a hypercube. Two vertices are adjacent in a hypercube exactly when their Hamming distance is 1. A code is a perfect-er ...
  • Oregon State University. Dept. of Computer Science; Bayer, Valentina; Dietterich, Thomas Glen (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2000)
    This paper introduces the even-odd POMDP, an approximation to POMDPs in which the world is assumed to be fully observable every other time step. The even-odd POMDP can be converted into an equivalent MDP, the 2MDP, whos ...
  • Oregon State University. Dept. of Computer Science; Zubek, Valentina Bayer; Dietterich, Thomas Glen (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2004-07-05)
    This paper introduces the even-odd POMDP an approximation to POMDPs Partially Observable Markov Decision Problems in which the world is assumed to be fully observable every other time step. This approximation works wel ...
  • Oregon State University. Dept. of Computer Science; Dietterich, Thomas Glen (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2006-04-30)
    Summary: Four proposed metrics: [1] average relative reduction in training time (sample size, number of training experiences) [2] jumpstart (initial advantage of transfer algorithm) [3] handicap (how long it takes the ...
  • Oregon State University. Dept. of Computer Science; Zubek, Valentina Bayer; Dietterich, Thomas Glen (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2004)
    This paper addresses cost-sensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to formulate this as a Markov Decision Proc ...
  • Oregon State University. Dept. of Computer Science; Stumpf, Simone; Burnett, Margaret, 1949-; Dietterich, Thomas Glen; Johnsrude, Kevin; Herlocker, Jonathan Lee (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2005)
    This paper presents qualitative results from interviews with knowledge workers about their recovery strategies after interruptions. Special focus is given to when these strategies fail due to the nature of the interrupti ...
  • Oregon State University. Dept. of Computer Science; Srinivasan, Madhusudhanan; Metoyer, Ronald A., 1971- (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2005)
    This paper presents an empirical approach for measuring and characterizing the responsiveness of a character to changes in goal. Our approach is based on keeping track of the character's progress towards a frequently cha ...
  • Oregon State University. Dept. of Computer Science; Pandey, Rajeev K.; Pesch, Wolfgang; Shur, Jim; Takikawa, Masami (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1993-01-29)
    "This report describes the revised definition of the multiparadigm programming language Leda. The first section provides an introduction to Leda and a history of its development. Section 2 covers Leda preliminaries, sect ...
  • Palacios, Jonathan; Yeh, Harry Hsiu-jen; Wang, Wenping; Laramee, Robert S.; Vincent, Paul; Zhang, Eugene (Corvallis, OR : School of Electrical Engineering and Computer Science, Oregon State University, 2013)
    Three-dimensional symmetric tensor fields have a wide range of applications in solid and fluid mechanics. Recent advances in the topological analysis of 3D symmetric tensor fields focus on the local behaviors of tensor f ...
  • Oregon State University. Dept. of Computer Science; Capocelli, Renato M.; Cull, Paul, 1943- (Corvallis, OR : Oregon State University, Dept. of Computer Science, 2002-05)
    It is well known that the Fibonacci numbers can be expressed in the form Round {1/√5 λ₀[superscript n]} where λ₀ = (1 + √5)/2. [Knu75] We look at integer sequences which are solutions to non-negative difference equation ...
  • Oregon State University. Dept. of Computer Science; Bohus, Carisa; Aktan, Burcin; Shor, Molly H.; Crowl, Lawrence Alan, 1959- (Corvallis, OR : Oregon State University, Dept. of Computer Science, 1995-08)
    An important issue in engineering education is the availability of laboratory resources for student use. Using a computer network to link geographically distant students with laboratory teaching resources makes expensive ...

Search ScholarsArchive@OSU


Advanced Search

Browse

My Account

Statistics