Search

1993

Szafron, Duane, Holst, Wade

Technical report TR93-07. A \"first\" implementation of the Modular Smalltalk object-oriented programming language is presented. The implementation includes an object-oriented parser, object-oriented representation for code fragments and an object-oriented C-code generator, all implemented in...

1995

de Bruin, Arie, Plaat, Aske, Schaeffer, Jonathan, Pijls, Wim

Technical report TR95-15. This paper has three main contributions to our understanding of fixed-depth minimax search: (A) A new formulation for Stockman's SSS* algorithm, based on Alpha-Beta, is presented. It solves all the perceived drawbacks of SSS, finally transforming it into a practical...

1994

Schaeffer, Jonathan, Pijls, Wim, de Bruin, Arie, Plaat, Aske

Technical report TR94-18. This paper introduces a new paradigm for minimax game-tree search algorithms. MT is a memory-enhanced version of Pearl's Test procedure. By changing the way MT is called, a number of best-first game-tree search algorithms can be simply and elegantly constructed...

1995

Ozsu, M. Tamer, Goralwalla, Iqbal, Szafron, Duane, Leontiev, Yuri

Technical report TR95-13. In this work, we present a uniform behavioral temporal object model which includes a rich and extensible set of types and behaviors to support various notions of time. Our temporal model supports the continuous and discrete domains of time. It also supports various...

Fall 2009

Waugh, Kevin

For zero-sum games, we have efficient solution techniques. Unfortunately, there are interesting games that are too large to solve. Here, a popular approach is to solve an abstract game that models the original game. We assume that more accurate the abstract games result in stronger strategies....

2013

Sturtevant, Nathan R., Valenzano, Richard, Schaeffer, Jonathan

While greedy best-first search (GBFS) is a popular algorithm for solving automated planning tasks, it can exhibit poor performance if the heuristic in use mistakenly identifies a region of the search space as promising. In such cases, the way the algorithm greedily trusts the heuristic can cause...

1994

Szafron, Duane, Schaeffer, Jonathan

Technical report TR94-03. The growth of commercial and academic interest in parallel and distributed computing during the past fifteen years has been accompanied by a corresponding increase in the number of available parallel programming systems (PPS). However, little work has been done to...

1998

Schaeffer, Jonathan, Novillo, Diego, Unrau, Ronald

Technical report TR98-11. Most current compiler analysis techniques are unable to cope with the semantics introduced by explicit parallel and synchronization constructs in parallel programs. In this paper we introduce new analysis and optimization techniques for compiling explicitly parallel...

2005

Dong, Xaoli, Wishart, David S., Stothard, Paul, Greiner, Russ, Guo, AnChi, van Domselaar, Gary H., Szafron, Duane, Shrivastava, Savita, Cruz, Joseph A., Lu, Paul

BASys (Bacterial Annotation System) is a web server that supports automated, in-depth annotation of bacterial genomic (chromosomal and plasmid) sequences. It accepts raw DNA sequence data and an optional list of gene identification information and provides extensive textual annotation and...

2008

Schaeffer, Jonathan, Sturtevant, Nathan, Holte, Robert, Anderson, Ken

Technical report TR08-05. The following report describes some techniques that generalize and attempt to improve upon the Coarse-to-Fine Dynamic Programming (CFDP) algorithm developed by Christopher Raphael. CFDP uses a hierarchy of abstraction graphs, iteratively searches to find optimal...