4372 search results - page 42 / 875 » Algorithmic Theories of Everything |
ICTAI
2003
IEEE
2003
IEEE
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
14 years 1 months ago
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
FCT
2007
Springer
14 years 2 months ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimens...
FSKD
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. Some comparable experiments have been completed in o...
AMC
2007
13 years 8 months ago
2007
A hierarchical least squares (HLS) algorithm is derived in details for identifying MIMO ARX-like systems based on the hierarchical identification principle. It is shown that the ...