Planning under uncertainty has been well studied, but usually the uncertainty is in action outcomes. This work instead investigates uncertainty in the amount of time that actions ...
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
There are infinitely many variants of the notion of Kan fibration that, together with suitable choices of cofibrations and the usual notion of weak equivalence of simplicial sets, ...
Chaotic attractors generated by the iteration of polynomial functions with cyclic symmetry have been the subject of recent study. A new formulation is investigated which generates ...
We propose a simple and powerful predictive interface technique for text editing tasks. With our technique called the dynamic macro creation, when a user types a special "rep...