Search
Skip to Search Results- 4Computer Games
- 4Distributed computing
- 4Programming environments
- 3Computer games
- 3Generative pattern
- 3Scripting language
- 22Computing Science, Department of
- 22Computing Science, Department of/Technical Reports (Computing Science)
- 5Educational Psychology, Department of
- 5Educational Psychology, Department of/Journal Articles (Educational Psychology)
- 1Graduate and Postdoctoral Studies (GPS), Faculty of
- 1Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
-
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
-
Enterprise: An Interactive Graphical Programming Environment For Distributed Software Development
Download1991
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...
-
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...
-
2008
Schaeffer, Jonathan, Cutumisu, Maria, Waugh, Kevin, Siegel, Jeff, Szafron, Duane, Schumacher, Allan, Duff, Harvey, Gillis, Stephanie, Carbonaro, Mike, Onuczko, Curtis
The unprecedented growth in numbers of children playing computer games has stimulated discussion and research regarding what, if any, educational value these games have for teaching and learning. The research on this topic has primarily focused on children as players of computer games rather than...
-
1992
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...
-
2009
Bowling, Michael, Zinkevich, Martin, Waugh, Kevin, Lanctot, Marc
Technical report TR09-15. Sequential decision-making with multiple agents and imperfect information is commonly modeled as an extensive game. One efficient method for computing Nash equilibria in large, zero-sum, imperfect information games is counterfactual regret minimization (CFR). In the...
-
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...