Search

2004

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

The state-of-the-art in game scripting is to manually script individual game objects that interact in the game. Thousands of non-player characters (NPCs) and props need to be scripted before they play a part in a game adventure. This situation introduces serious concerns about programming effort...

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

2017

Cui, Y., Guo, Q., Cutumisu, M.

In computer-based tutoring systems, it is important to assess students’ mastery of different skills and provide remediation. In this study, we propose a novel neural network approach to estimate students’ skill mastery patterns. We conducted a simulation to evaluate the proposed neural network...

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

2014

Cutumisu, M., Schwartz, D.L.

This research examines the effect of age on students’ choices to seek negative feedback and to revise, as well as on students’ learning based on these choices. We designed Posterlet, an assessment game that measures the choices to seek negative feedback and to revise. In this study, 764 students...

2016

Schwartz, D. L., Cutumisu, M.

Studies examining feedback in educational settings have largely focused on feedback that is received, rather than chosen, by students. This study investigates whether adult participants learn more from choosing rather than receiving feedback from virtual characters in a digital poster design...

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