is here
http://www.cs.cmu.edu/afs/cs/project/jair/pub/volume15/hong01a.pdf
Rao
ps: Here is a paper talking about minimizing a possibly non-minimal plan. It shows the NP-completeness of
minimization and talks about polynomial sound-but-incomplete minimization algorithms
http://citeseer.ist.psu.edu/fink92spectrum.html
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment