The pre-processing stage of finite element analysis of the Navier-Stokes equations is becoming increasingly important as the desire for more general boundary conditions, as well a...
Anil Kumar Karanam, Kenneth E. Jansen, Christian H...
We present a game model for classical PCF, a nite version of PCF extended by a catch/throw mechanism. This model is build from E-dialogues, a kind of two-players game de ned by Lor...
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Plan recognition is the problem of inferring the goals and plans of an agent after observing its behavior. Recently, it has been shown that this problem can be solved efficiently,...
We introduce a graphical framework for Bayesian inference that is sufficiently general to accommodate not just the standard case but also recent proposals for a theory of quantum...