Search

1994

Culberson, Joseph, Schaeffer, Jonathan

Technical report TR94-08. The A* algorithm for single-agent search has attracted considerable attention in recent years due to Korf's iterative deepening improvement (IDA). The algorithm's efficiency depends on the quality of the lower bound estimates of the solution cost. For sliding tile...

1993

Szafron, Duane, Schaeffer, Jonathan, Wilson, Gregory

Technical report TR93-09. The explosive 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, and in the variety of approaches to...

1994

Iglinski, Paul, Smith, Carol, Morrow, Chris, Szafron, Duane, Schaeffer, Jonathan, Parsons, Ian, Kornelsen, Randal

Technical report TR94-04. This document is a user's manual for version 2.2 of the Enterprise parallel programming system. Enterprise is an interactive graphical programming environment for designing, coding, debugging, testing and executing programs in a distributed hardware environment. ...

1995

MacDonald, Steve, Schaeffer, Jonathan, Novillo, Diego, Woloschuk, David, Parsons, Ian, Szafron, Duane, Iglinski, Paul, Morrow, Chris

Technical report TR95-02. This paper contains an introduction and user manual for the Enterprise Parallel Programming System, including the programming model, the meta-programming model and tools (animation, replay and debugging). | TRID-ID TR95-02

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...

2003

Greiner, Russ, Poulin, B., Lu, Paul, Anvik, J., Lu, Z., Macdonell, Cam, Wishart, David, Eisner, Roman, Szafron, Duane

Technical report TR03-09. Naive Bayes classifiers, a popular tool for predicting the labels of query instances, are typically learned from a training set. However, since many training sets contain noisy data, a classifier user may be reluctant to blindly trust a predicted label. We present 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...

2012

Lanctot, Marc, Gibson, Richard, Burch, Neil, Szafron, Duane

In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. While the base algorithm performs a full tree traversal on each iteration, Monte Carlo CFR (MCCFR) reduces the per...

2006

Onuczko, Curtis, Schaeffer, Jonathan, Cutumisu, Maria, Roy, Thomas, Carbonaro, Mike, McNaughton, Matthew, Szafron, Duane

To compete in today's market, companies that develop computer role-playing games (CRPGs) must quickly and reliably create realistic, engaging game stories. Indeed, intricate storylines and realism that goes beyond graphics have become major product differentiators. To establish both, it's...

2006

Cutumisu, Maria, Szafron, Duane, Roy, Thomas, Carbonaro, Mike, McNaughton, Matthew, Schaeffer, Jonathan, Onuczko, Curtis

Many computer games use custom scripts to control the ambient behaviors of non-player characters (NPCs). Therefore, a story writer must write fragments of computer code for the hundreds or thousands of NPCs in the game world. The challenge is to create entertaining and non-repetitive behaviors...