Technical Reports (Computing Science)

2004

Zhou, Peng, Amaral, Nelson

Technical report TR04-18. Large functions appear frequently in today's applications. They present challenges to modern compilers not only because they increase the compilation cost including time and resources but also they usually degrade the quality of the final executables. To reduce these...

2012

Lanctot, Marc, Gibson, Richard, Burch, Neil, Szafron, Duane

In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. While the base algorithm performs a full tree traversal on each iteration, Monte Carlo CFR (MCCFR) reduces the per...

1992

Lewchuk, Michael

Technical report TR92-05. Genetic algorithms are adaptive search algorithms which generate and test a population of individuals, where each individual corresponds to a solution. They then adapt to the information obtained from testing, seeking superior solutions by selecting and combining...

1992

Culberson, Joseph

Technical report TR92-02. This paper presents some experimental results and analyses of the gene invariant genetic algorithm(GIGA). Although a subclass of the class of genetic algorithms, this algorithm and its variations represent a unique approach with many interesting results. The primary...

2003

Oliveira, Stanley, Zaiane, Osmar

Technical report TR03-12. Despite its benefit in a wide range of applications, data mining techniques also have raised a number of ethical issues. Some such issues include those of privacy, data security, intellectual property rights, and many others. In this paper, we address the privacy problem...

1992

Culberson, Joseph

Technical report TR92-06. This document describes the gene invariant genetic algorithm (GIGA) program. This program represents a unique approach to designing GAs with many interesting results. The primary distinguishing feature is that when a pair of offspring are created and chosen as worthy...

1992

Yang, Zhonghua, Marsland, Tony

Technical report TR92-03. The widespread adoption of distributed computing has accentuated the need for an effective set of support tools to facilitate debugging and monitoring. In providing such support, one fundamental problem is that of constructing a global snapshot or global state of a...

2019-01-01

Lloyd, Taylor, Ali, Karim, Amaral, Jose Nelson

Graphics Processing Units~(GPUs) have been widely used to accelerate the performance of programs. However, such performance gains can be significantly degraded by irregular data accesses and by control-flow divergence. Both of these performance issues arise only in the presence of...

1995

Abbas, Nesrine

Technical report TR95-01. In this thesis we study graph clustering on two well known families of graphs that arise in many applications, namely bipartite and chordal graphs. We study two specific types of clustering problems. On the one hand we seek a partition of the vertex set of a graph into...

2003

Caelli, Terry, Caetano, Tiberio, Barone, Dante

Technical report TR03-21. This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler models in which optimal inference is feasible, and contrast them to the well-known...