318 search results - page 8 / 64 » Decomposition of Domains |
93
Voted
AAAI
2006
14 years 11 months ago
2006
Two of the most efficient planners for planning in nondeterministic domains are MBP and ND-SHOP2. MBP achieves its efficiency by using Binary Decision Diagrams (BDDs) to represent...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper, a new class of audio representations is introduced, together with a corresponding fast decomposition algorithm. The main feature of these representations is that th...
AIPS
1996
14 years 11 months ago
1996
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
102
click to vote
MOC
2002
14 years 9 months ago
2002
Abstract. We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as spe...
SAS
1999
Springer
15 years 2 months ago
1999
Springer
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...