Domain Independent Approaches for Finding Diverse Plans
暂无分享,去创建一个
Subbarao Kambhampati | Ivan Serina | Alfonso Gerevini | Biplav Srivastava | Tuan Anh Nguyen | Minh Binh Do | S. Kambhampati | A. Gerevini | I. Serina | M. Do | B. Srivastava | T. Nguyen
[1] Yi Zhang,et al. Novelty and redundancy detection in adaptive filtering , 2002, SIGIR '02.
[2] Barry O'Sullivan,et al. Finding Diverse and Similar Solutions in Constraint Programming , 2005, AAAI.
[3] John Levine,et al. Generation of Multiple Qualitatively Different Plan Options , 1998, AIPS.
[4] Henry A. Kautz,et al. BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving , 1998 .
[5] Karen L. Myers,et al. Generating qualitatively Different Plans througt Metatheoretic Biases , 1999, AAAI/IAAI.
[6] KambhampatiSubbarao,et al. Planning as constraint satisfaction , 2001 .
[7] Mark S. Boddy,et al. Course of Action Generation for Cyber Security Using Classical Planning , 2005, ICAPS.
[8] Biplav Srivastava,et al. Managing the Life Cycle of Plans , 2005, AAAI.
[9] Ivan Serina,et al. Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..
[10] Karen L. Myers. Metatheoretic Plan Summarization and Comparison , 2006, ICAPS.
[11] Subbarao Kambhampati,et al. Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP , 2001, Artif. Intell..
[12] Ivan Serina,et al. Plan Stability: Replanning versus Plan Repair , 2006, ICAPS.
[13] Koustuv Dasgupta,et al. Adaptation inWeb Service Composition and Execution , 2006, 2006 IEEE International Conference on Web Services (ICWS'06).