This is a decommissioned version of ERA which is running to enable completion of migration processes. All new collections and items and all edits to existing items should go to our new ERA instance at https://ualberta.scholaris.ca - Please contact us at erahelp@ualberta.ca for assistance!
Technical Reports (Computing Science)
Technical Reports Collection
Items in this Collection
- 28Szafron, Duane
- 21Schaeffer, Jonathan
- 19Zaiane, Osmar
- 15Ozsu, M. Tamer
- 14Nascimento, Mario
- 13Yang, Herb
- 29Database Systems
- 18Artificial Intelligence
- 13Computer Games
- 9Computer Graphics
- 9Databases
- 8Communication Networks
-
1996
Pu, Calton, Meersman, Robert, Liu, Ling
Technical report TR96-11. We propose a transactional activity model (TAM) for specification and management of open-ended cooperative activities. TAM is a careful combination of an activity composition model with extended transaction models such as split/join transactions. In contrast to each of...
-
A Unified Framework for Searching Multiple Compressed Collections
2001
Nascimento, Mario, Oliveira, Stanley
Technical report TR01-17. In this work, we propose a new framework for searching directly through multiple compressed collections. We combine, in a single framework, four techniques for efficient, low-overhead text retrieval: inverted index compression, block addressing, sequential searching in...
-
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...
-
1995
Technical report TR95-18. Multimedia databases store large data objects with complex spatial and temporal relationships. For users to easily and effectively access and make use of this large information space, there is a need for an interactive user interface to act as an intermediary between...
-
2010
Lin, Guohui, Shi, Xiaoyu, Hu, Yu, Zeng, Dahua, Zaiane, Osmar
Technical report TR10-04. This paper describes a novel and fast placement algorithm for field programmable gate array (FPGA) design space exploration. The proposed algorithm generates the placement based on the topological similarity between two configurations (netlists) in the design space....
-
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement - Extended Version
Download2010
Nakhost, Hootan, Müller, Martin
Technical report TR10-01. Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become increasingly important. The most recent planning competition IPC-2008 used the cost of the...
-
Adaptive Schema Design and Evaluation in Object-Oriented Information Systems
1995
Technical report TR95-20. This paper develops a formal framework for characterizing \"normalization\" in object-oriented schema design. We introduce style rules for achieving validity, minimality, and extensibility of an object-oriented schema, and the style rules that help to eliminate update...
-
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...
-
2009
Malhotra, Baljeet, Nikolaidis, Ioanis, Nascimento, Mario
Technical report TR09-14. We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommodates transmission dependencies that allow in-network aggregation to be performed. We formulate the...
-
2005
Technical report TR05-01. Given a tree T consider one of its longest paths PT. We define T to be m-distant if all of its vertices are a distance at most m from PT. We will show that any 3-distant tree satisfying both of the following properties is graceful. The tree has a perfect matching....