Search
Skip to Search Results- 26Schaeffer, Jonathan
- 15Szafron, Duane
- 9Culberson, Joseph
- 5Carbonaro, Mike
- 5Cutumisu, Maria
- 4Lu, Paul
- 4Distributed computing
- 4Programming environments
- 3Computer Games
- 3Computer games
- 3Generative pattern
- 3Scripting language
-
2007
Culberson, Joseph, Yang, Fan, Holte, Robert
Technical report TR07-06. The effectiveness of heuristics search is influnced by the accuracy of the heuristic values. State space abstractions have been proved to be effective for generating admissible heuristics. In this paper, A general definition for abstractions is given. As a demonstration...
-
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...
-
1994
Culberson, Joseph, Evans, Patricia
Technical report TR94-09. In this paper we explore the relationship between asymmetries in deletion algorithms used in updating binary search trees, and the resulting long term behavior of the search trees. We show that even what would appear to be negligible asymmetric effects accumulate to...
-
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...