Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
We propose a model for level-ups in Heroes of Might and Magic III, and give an O 1 ε2 ln 1 δ learning algorithm to estimate the probabilities of secondary skills induced by any ...
Antialiased pixel values are often computed as the mean of N point samples. Using uniformly distributed random samples, the central limit theorem predicts a variance of the mean o...
This paper is concerned with information theoretic "metrics" for comparing two dynamical systems. Following the recent work of Tryphon Georgiou [1], we outline a predicti...
We describe “Belvedere,” a system to support students engaged in critical discussion of science and public policy issues. The design is intended to address cognitive and metac...
Massimo Paolucci, Daniel D. Suthers, Arlene Weiner