240 search results - page 17 / 48 » Improved Adomian decomposition method |
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
AI
2003
Springer
14 years 22 days ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
ECML
1997
Springer
13 years 11 months ago
1997
Springer
In learning from examples it is often useful to expand an attribute-vector representation by intermediate concepts. The usual advantage of such structuring of the learning problemi...
CMS
2003
13 years 8 months ago
2003
Abstract. Wavelet packet decompositions generalize the classical pyramidal wavelet structure. We use the vast amount of possible wavelet packet decomposition structures to create a...
SIGGRAPH
2009
ACM
14 years 2 months ago
2009
ACM
We present a novel parallel continuous collision detection (PCCD) method to utilize the widely available multi-core CPU architecture. Our method works with a wide variety of defor...