200 search results - page 28 / 40 » What Graphs can be Efficiently Represented by BDDs |
AIPS
1996
13 years 8 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...
AAAI
2010
13 years 9 months ago
2010
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
KNINVI
2005
Springer
14 years 1 months ago
2005
Springer
The timeworn claim that a picture is worth a thousand words is generally well-supported by empirical evidence, suggesting that diagrams and other information graphics can enhance h...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
ISSS
2000
IEEE
13 years 12 months ago
2000
IEEE
Even though high-level hardware synthesis from dataflow graphs becomes popular in designing DSP systems, currently used dataflow models are inefficient to deal with emerging multi...