Search
Skip to Search Results- 7Object-oriented
- 4Computer Games
- 4Databases
- 4Distributed computing
- 4Multimedia
- 4Programming environments
-
1993
Technical report TR93-07. A \"first\" implementation of the Modular Smalltalk object-oriented programming language is presented. The implementation includes an object-oriented parser, object-oriented representation for code fragments and an object-oriented C-code generator, all implemented in...
-
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...
-
A Study of Image Indexing Techniques for Multimedia Database Systems
1995
Niu, Youping, Ozsu, M. Tamer, Li, Xiaobo
Technical report TR95-19. The role of indexing in query optimization is well-understood in the database community. Indexes enable efficient access to a subset of a database. There have been many studies on indexing within the context of relational database management systems (RDBMS). The most...
-
1995
Ozsu, M. Tamer, Goralwalla, Iqbal, Szafron, Duane, Leontiev, Yuri
Technical report TR95-13. In this work, we present a uniform behavioral temporal object model which includes a rich and extensible set of types and behaviors to support various notions of time. Our temporal model supports the continuous and discrete domains of time. It also supports various...
-
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
Goralwalla, Iqbal, Ozsu, M. Tamer, Tansel, Abdullah
Technical report TR94-15. In this paper we describe an implementation of a temporal relational database management system based on attribute timestamping. For this purpose we modify an existing software which supports set-valued attributes. The algebraic language of the system includes...
-
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...
-
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...