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
-
2009
Bhatnagar, Shalabh, Sutton, Richard, Ghavamzadeh, Mohammad, Lee, Mark
Technical report TR09-10. We present four new reinforcement learning algorithms based on actor-critic, function approximation, and natural gradient ideas, and we provide their convergence proofs. Actor-critic reinforcement learning methods are online approximations to policy iteration in which...
-
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...
-
1988
Marsland, Tony, Sutphen, Steven, Breitkreutz, T.
Technical report TR88-22. The report describes an environment for performing experiments in distributed processing. It replaces an earlier (1985) report, reflecting changes in the system and terminology. Our system offers researchers an easy way to design, implement, and test parallel...
-
1996
Sorenson, Paul, Findeisen, Piotr, Zhuang, Yong
Technical report TR96-13. Metaview is a metasystem that can generate automatically environments to support software engineering activities, such as requirement analysis and design. This report focuses on creating Object-Oriented (O-O) support environments in Metaview to help efficiently construct...
-
2012
Bowling, Michael, Zinkevich, Martin
Online learning aims to perform nearly as well as the best hypothesis in hindsight. For some hypothesis classes, though, even finding the best hypothesis offline is challenging. In such offline cases, local search techniques are often employed and only local optimality guaranteed. For online...
-
1998
Ozsu, M. Tamer, Szafron, Duane, Leontiev, Yuri
Technical report TR98-02. In this paper we present a model that supports a clean separation between the concepts of interface, implementation, and representation. We present several problems that are difficult to solve in the absence of such separation and describe how the proposed model can be...
-
1988
Culberson, Joseph, Rawlins, Gregory
Technical report TR88-01. A great deal of effort has been directed towards determining the minimum number of binary comparisons sufficient to produce various partial orders given some partial order. For example, the sorting problem considers the minimum number of comparisons sufficient to...
-
On the epistemic entrenchment of different types of knowledge expressed as conditionals in belief revision tasks
Download1996
Technical report TR96-16. Some belief revision theories appeal to the notion of epistemic entrenchment as a guide to choosing among alternative ways of removing inconsistency that new information may cause with existing beliefs. While belief revision theorists may not be interested in natural...
-
On the Futility of Blind Search
1996
Technical report TR96-18. This paper might have been subtitled \"An algorithmicist looks at no free lunch.\" We use simple adversary arguments to redevelop and explore some of the no free lunch (NFL) theorems and perhaps extend them a little. A second goal is to clarify the relationship of NFL...
-
On the Trade-Off Between User-Location Privacy and Queried-Location Privacy in Wireless Sensor Networks
Download2009
Harms, Janelle, Vogt, Ryan, Nascimento, Mario
Technical report TR09-07. By eavesdropping on a user's query in a sensor network, an adversary can deduce both the user's location and his/her area of interest. In many domains it is desirable to guarantee privacy of both places. Relying on the principle of k-anonymity, we propose an effective...