1897 search results - page 19 / 380 » Conditional Linear Planning |
AAAI
1996
13 years 10 months ago
1996
AIPS
2010
13 years 11 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
AIPS
2011
13 years 10 days ago
2011
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...
ISCAS
2005
IEEE
14 years 2 months ago
2005
IEEE
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...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
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...