Technical Reports (Computing Science)

1991

Mohsin, Jimmy, Schaeffer, Jonathan, Lu, Paul, Chan, Enoch, Szafron, Duane, Smith, Carol, Wong, Pok Sze

Technical report TR91-17. Workstation environments have been in use for more than a decade now. Although a network of workstations together represents a large amount of aggregate computing power, single users often cannot utilize these resources for their applications. Enterprise is a...

2001

Schaeffer, Jonathan, Charter, K., Lu, Paul, Szafron, Duane, Parsons, I., Driga, A.

Technical report TR01-10. For two DNA or protein sequences of length m and n, dynamic programming alignment algorithms like Needleman-Wunsch and Smith-Waterman take O(m x n) time and use O(m x n) space, so we refer to them as full matrix (FM) algorithms. This space requirement means that large...

1992

Schaeffer, Jonathan

Technical report TR92-19. In August 1992, the first man versus machine world championship took place. The champion, Dr. Marion Tinsley, is arguably the greatest checkers player that ever lived. The challenger was the computer checkers program Chinook, a 3 year team effort from the University of...

1994

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

Technical report TR94-19. Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth minimax tree-search algorithm traversing a uniform tree must explore, the so-called minimal tree Since real-life minimax trees aren't uniform, the exact size of this tree...

1993

Schaeffer, Jonathan, Lobe, Greg, Szafron, Duane

Technical report TR93-04. The Enterprise programming environment supports the development of applications that run concurrently on a network of workstations. This paper describes the object-oriented components of Enterprise, implemented in Smalltalk-80, and their seamless integration with ...

2004

Cutumisu, M., McNaughton, M., Parker, D., Schaeffer, Jonathan, Redford, J., Szafron, Duane

Technical report TR04-05. Recently, some researchers have argued that generative design patterns (GDPs) can leverage the obvious design re-use that characterizes traditional design patterns into code re-use. This paper provides additional evidence that GDPs are both useful and productive. ...

1993

Lake, Robert, Schaeffer, Jonathan, Lu, Paul

Technical report TR93-13. Chess endgame databases, while of important theoretical interest, have yet to make a significant impact in tournament chess. In the game of checkers, however, endgame databases have played a pivotal role in the success of our World Championship challenger program...

1994

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

Technical report TR94-17. In 1979 Stockman introduced the SSS* minimax search algorithm that dominates Alpha-Beta in the number of leaf nodes expanded. Further investigation of the algorithm showed that it had three serious drawbacks, which prevented its use by practitioners: it is difficult to...

1996

Schaeffer, Jonathan, Brockington, Mark

Technical report TR96-07. This paper introduces the APHID (Asynchronous Parallel Hierarchical Iterative Deepening) game-tree search algorithm. An APHID search is a hierarchical search with a master controlling the top of the tree (d' ply), and the slaves searching the rest of the tree (d-d'...

1992

Schaeffer, Jonathan, Lobe, Greg, Parsons, Ian, Szafron, Duane, Melax, Stan, Smith, Carol, Lu, Paul

Technical report TR92-20. Workstations have been in use for more than a decade now. Although a network of workstations represents a large amount of aggregate computing power, there is a need for software that can harness this power for single, distributed applications. Enterprise is an...