Search

1993

Lake, Robert, Schaeffer, Jonathan, Lu, Paul

Technical report TR93-13. Chess endgame databases, while of important theoretical interest, have yet to make a significant impact in tournament chess. In the game of checkers, however, endgame databases have played a pivotal role in the success of our World Championship challenger program...

2003

Hernadvolgyi, Istvan

Technical report TR03-16. The Sequential Ordering Problem (SOP) is a version of the Asymmetric Traveling Salesman Problem (ATSP) where precedence constraints on the vertices must be observed. The SOP has many real life applications and it has proved to be a challenge as there are SOPs of order...

2007

Stroulia, Eleni

Technical report TR07-09. The objective of this paper is to explore the relationship between the engineering of Service-Oriented Applications and some strategic and economic concerns of the organizations that (consider to) adopt this architecture style for the development of their software...

1996

Szafron, Duane, Li, John, Ozsu, M. Tamer

Technical report TR96-05. In this paper we consider various spatial relationships that are of general interest for retrieving data from multimedia databases. We present a unified representation of spatial objects for both topological and directional relations. Such a representation is based on...

1995

Gao, Yaoqing, Marsland, Tony

Technical report TR95-05. The extreme efficiency of sequential search, and the natural tendency of tree pruning systems to produce wide variations in workload, partly explains why it is proving difficult to achieve more than 30-50% efficiency for massively parallel implementations of the...

2008

Sander, Joerg, Zhou, Jianjun

Technical report TR08-09. Many clustering algorithms in particular hierarchical clustering algorithms do not scale-up well for large data-sets especially when using an expensive distance function. In this paper, we propose a novel approach to perform approximate clustering with high accuracy....

2002

Yang, Herb, Gong, Minglun

Technical report TR02-09. Spiral texture mapping extends and combines two main categories of texture mapping approaches, namely, displacement texture mapping and view-dependent texture mapping. A spiral texture contains two components: a view-independent one and a view-dependent one. The first...

1994

Schaeffer, Jonathan, Pijls, Wim, Plaat, Aske, de Bruin, Arie

Technical report TR94-17. In 1979 Stockman introduced the SSS* minimax search algorithm that dominates Alpha-Beta in the number of leaf nodes expanded. Further investigation of the algorithm showed that it had three serious drawbacks, which prevented its use by practitioners: it is difficult to...

2007

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

Technical report TR07-05. We investigate novel, dual algorithms for dynamic programming and reinforcement learning, based on maintaining explicit representations of stationary distributions instead of value functions. In particular, we investigate the convergence properties of standard dynamic...

2004

Hernadvolgyi, Istvan, Holte, Robert

Technical report TR04-02. The long-term goal of our research is to develop robust methods that use abstraction to create heuristics automatically from a description of a search space. Our research has progressed significantly towards this goal. This paper reviews the current state of the art, and...