The necessity for improved players and opponents in firstperson entertainment-based real-time artificial environments has inspired our research into artificial game players. We em...
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
This paper describes a low-complexity approach for reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arr...
Maxim Raginsky, Sina Jafarpour, Rebecca Willett, A...
This paper studies the quasi-static motion of large legged robots that have many degrees of freedom. While gaited walking may suffice on easy ground, rough and steep terrain requi...
Kris K. Hauser, Timothy Bretl, Jean-Claude Latombe...
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...