Technical Reports (Computing Science)

2007

Wang, Tao, Bowling, Michael, Lizotte, Daniel, Schuurmans, Dale

Technical report TR07-10. We propose to use a new dual approach to dynamic programming. The idea is to maintain an explicit representation of stationary distributions as opposed to value functions. A significant advantage of the dual approach is that it allows one to exploit well developed...

2008

Lizotte, Daniel, Wang, Tao, Bowling, Michael, Schuurmans, Dale

Technical report TR08-16. We propose a dual approach to dynamic programming and reinforcement learning based on maintaining an explicit representation of visit distributions as opposed to value functions. An advantage of working in the dual is that it allows one to exploit techniques for...

2006

Wang, Tao, Schuurmans, Dale, Bowling, Michael

Technical report TR06-26. We investigate the dual approach to dynamic programming and reinforcement learning, based on maintaining an explicit representation of stationary distributions as opposed to value functions. A significant advantage of the dual approach is that it allows one to exploit...

2003

Rudnicki, Piotr, Hoover, Jim, Hou, Daqing

Technical report TR03-22. Different program analyses require different information from the source code. For some applications, an AST (Abstract Syntax Tree) representation of the source may be sufficient. We want to be able to specify assertions on the structure of a program without mentioning...

1993

Farrage, S, Marsland, Tony

Technical report TR93-03. There are several ways to search decision trees (one and two-person game trees) in parallel, from simple splitting at the root and Principal Variation Splitting, to Baudet's use of aspiration windows. These static schemes are simple and effective, but dynamic methods...

2003

Jari, Kavita

Technical report TR03-02. Today's teaching and learning practices are evolving to leverage the continuously increasing information available on the web for all conceivable subject matters. This change is clearly visible in the field of Web-based learning. Instructors use on-line information...

2008

Niewiadomski, Robert, Amaral, Jose Nelson, Holte, Robert

Technical report TR08-18. We present an advanced Bidirectional A* algorithm featuring an application of Frontier Search and a strategy for the performance-efficient utilization of External Memory. We present the results of an experimental evaluation demonstrating that this algorithm is capable of...

2005

Curial, Stephen, Rafiei, Davood

Technical report TR05-08. We study the problem of visualizing large networks and develop techniques for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduction techniques are based on sampling, where only a sample instead of the full...

1997

Unrau, Ronald, Krieger, Orran

Technical report TR97-08. We present a new facility for cross-address space IPC that exploits queues in memory shared between the client and server address space. The facility employs only widely available operating system mechanisms, and is hence easily portable to different commercial...

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...