SearchSkip to Search Results
- 28Szafron, Duane
- 21Schaeffer, Jonathan
- 19Zaiane, Osmar
- 15Ozsu, M. Tamer
- 14Nascimento, Mario
- 13Yang, Herb
- 29Database Systems
- 18Artificial Intelligence
- 13Computer Games
- 9Computer Graphics
- 8Communication Networks
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...
Curiosity is a critical component of intelligence. One method of motivating curious behaviour in computational systems is to use reinforcement learning to learn which decisions maximize the amount of unexpected error observed by a predictive component. However, reinforcement learning algorithms...
Curiosity is a crucial, but not yet well-understood component of intelligence and a better understanding of existing models may lead to a better understanding of curiosity as a whole. In this work, we present a physical robot implementation of the basic curiosity loop introduced by Gordon and...
Thread Level Speculation (TLS) is a hardware/software technique that guarantees correct parallel execution of loops even in the presence of dependence and has potential to lead to performance gains through the parallelization of loops that cannot be proven to be free of dependencies at compile...
In this paper, we applied texture analysis to evaluate cerebral degeneration in amyotrophic lateral sclerosis (ALS). Two well-known methods, the gray level co-occurrence matrix (GLCM) and the gray level aura matrix (GLAM) were employed to extract texture features from routine T1 and T2 MR images....
This manual describes PSVN, a language for describing state space search problems using multi-valued variables that lends itself to efficient calculation of state's successors and predecessors without having to fully ground the operators. It also describes the PSVN compiler, psvn2c, which accepts...
Most of the satisficing planners which are based on heuristic search iteratively improve their solution quality through an anytime approach. Typically, the lowest-cost solution found so far is used to constrain the search. This avoids areas of the state space which cannot directly lead to lower...
Entropy measures of probability distributions are widely used measures in ecology, biology, genetics, and in other fields, to quantify species diversity of a community. Unfortunately, entropy–based diversity indices, or diversity indices for short, suffer from three problems. First, when...
In the field of computational game theory, games are often compared in terms of their size. This can be measured in several ways, including the number of unique game states, the number of decision points, and the total number of legal actions over all decision points. These numbers are either...