Compliant Conditions for Polynomial Time Approximation of Operator Counts
暂无分享,去创建一个
Sailik Sengupta | Subbarao Kambhampati | Tathagata Chakraborti | Sarath Sreedharan | T. K. Satish Kumar | S. Kambhampati | T. K. S. Kumar | T. Chakraborti | S. Sreedharan | Sailik Sengupta
[1] Subbarao Kambhampati,et al. An LP-Based Heuristic for Optimal Planning , 2007, CP.
[2] Laura Sebastia,et al. On the extraction, ordering, and usage of landmarks in planning , 2001 .
[3] Blai Bonet,et al. Flow-Based Heuristics for Optimal Planning: Landmarks and Merges , 2014, ICAPS.
[4] E.J. Candes,et al. An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.
[5] Y. Ye,et al. A Note on the Complexity of L p Minimization , 2009 .
[6] Stephen P. Boyd,et al. Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.
[7] Blai Bonet,et al. LP-Based Heuristics for Cost-Optimal Planning , 2014, ICAPS.
[8] Satyandra K. Gupta,et al. AI Planning Versus Manufacturing-Operation Planning: A Case Study , 1995, IJCAI.
[9] Malte Helmert,et al. A Normal Form for Classical Planning Tasks , 2015, ICAPS.
[10] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[11] Jian Li,et al. Linear Systems, Sparse Solutions, and Sudoku , 2010, IEEE Signal Processing Letters.