共 50 条
- [1] Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2016, 56 : 269 - 327
- [3] CRITICAL-PATH TENSIONING BY SPECIALIST SUPERVISION NUCLEAR ENGINEERING INTERNATIONAL, 1994, 39 (476): : 32 - 32
- [5] Cost-optimal planning, delete relaxation, approximability, and heuristics Journal of Artificial Intelligence Research, 2021, 70 : 169 - 204
- [6] Delete- and Ordering-Relaxation Heuristics for HTN Planning PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 4076 - 4083
- [7] Dynamic measurement of critical-path timing 2008 IEEE INTERNATIONAL CONFERENCE ON INTEGRATED CIRCUIT DESIGN AND TECHNOLOGY, PROCEEDINGS, 2008, : 249 - +
- [8] Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2014, 50 : 487 - 533
- [9] Cost-Optimal Planning, Delete Relaxation, Approximability, and Heuristics JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2021, 70 : 169 - 204
- [10] Scalable Critical-Path Based Performance Analysis 2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2012, : 1330 - 1340