Search

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

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

2019-01-01

Cutumisu, Maria, Adams, Cathy, Yuen, Connie, Hackman, Leah, Lu, Chang, Samuel, Mark, Chu, Byron

The Callysto Project is a collaborative project by Cybera and the Pacific Institute for Mathematical Sciences (PIMS), with funding from the Government of Canada. It involves the development and assessment of modules that promote data literacy and computational thinking. Using the Jupyter notebook...

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

2010

Carbonaro, Mike, Cutumisu, Maria, Schaeffer, Jonathan, Szafron, Duane

Enrollment in Computing Science university programs is at a dangerously low level. A major reason for this is the general lack of interest in Computing Science by females. In this paper, we discuss our experience with using a computer game construction environment as a vehicle to encourage female...

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