Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie T...
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
There are many ways to define richness of a discrete time signal. In this paper we consider a particular definition and explore the conditions under which a linear time invarian...
We derive closed formulas for the condition number of a linear function of the total least squares solution. Given an over determined linear systems Ax = b, we show that this condi...