A Combinatorial Search Perspective on Diverse Solution Generation
暂无分享,去创建一个
[1] Satya Gautam Vadlamudi,et al. Anytime Pack Heuristic Search , 2013, PReMI.
[2] Indrajit Ray,et al. Evaluating Diversity in Classical Planning , 2014, ICAPS.
[3] Ron Rymon,et al. Search through Systematic Set Enumeration , 1992, KR.
[4] Alexandra Coman,et al. Automated Generation of Diverse NPC-Controlling FSMs Using Nondeterministic Planning Techniques , 2013, AIIDE.
[5] Thierry Petit,et al. Finding Diverse Solutions of High Quality to Constraint Optimization Problems , 2015, IJCAI.
[6] Tom Bylander,et al. Complexity Results for Planning , 1991, IJCAI.
[7] Barry O'Sullivan,et al. Distance Constraints in Constraint Satisfaction , 2007, IJCAI.
[8] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[9] Alexandra Coman,et al. Generating Diverse Plans Using Quantitative and Qualitative Plan Distance Metrics , 2011, AAAI.
[10] Mark S. Boddy,et al. Course of Action Generation for Cyber Security Using Classical Planning , 2005, ICAPS.
[11] Alexandra Coman,et al. Plan-Based Character Diversity , 2012, AIIDE.
[12] Alexandra Coman,et al. Diverse Plan Generation by Plan Adaptation and by First-Principles Planning: A Comparative Study , 2012, ICCBR.
[13] Daniel Bryce,et al. Landmark-Based Plan Distance Measures for Diverse Planning , 2014, ICAPS.
[14] Lydia E. Kavraki,et al. A heuristic approach to finding diverse short paths , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).
[15] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..
[16] Michael Bloem,et al. Air Traffic Control Area Configuration Advisories from Near-Optimal Distinct Paths , 2014, J. Aerosp. Inf. Syst..
[17] Alexander Nadel,et al. Generating Diverse Solutions in SAT , 2011, SAT.
[18] Subbarao Kambhampati,et al. Generating diverse plans to handle unknown and partially known user preferences , 2012, Artif. Intell..
[19] Rina Dechter,et al. Search Algorithms for m Best Solutions for Graphical Models , 2012, AAAI.
[20] Thomas Eiter,et al. Under consideration for publication in Theory and Practice of Logic Programming 1 Finding Similar / Diverse Solutions in Answer Set Programming , 2003 .
[21] Karen L. Myers,et al. Generating qualitatively Different Plans througt Metatheoretic Biases , 1999, AAAI/IAAI.
[22] Indrajit Ray,et al. Using Planning for a Personalized Security Agent , 2012 .
[23] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[24] Alexandra Coman. Solution Diversity in Planning , 2012, AAAI.
[25] Subbarao Kambhampati,et al. Domain Independent Approaches for Finding Diverse Plans , 2007, IJCAI.
[26] Ivan Serina,et al. Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..
[27] Subbarao Kambhampati,et al. Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP , 2001, Artif. Intell..
[28] Barry O'Sullivan,et al. Finding Diverse and Similar Solutions in Constraint Programming , 2005, AAAI.
[29] Enrico Scala,et al. Plan Repair for Resource Constrained Tasks via Numeric Macro Actions , 2014, ICAPS.
[30] Robert P. Goldman,et al. Measuring Plan Diversity: Pathologies in Existing Approaches and A New Plan Distance Metric , 2015, AAAI.
[31] Sudeshna Sarkar,et al. Anytime Algorithms for Mining Groups with Maximum Coverage , 2012, AusDM.
[32] Subbarao Kambhampati,et al. Model-lite Planning for the Web Age Masses: The Challenges of Planning with Incomplete and Evolving Domain Models , 2007, AAAI.
[33] Satya Gautam Vadlamudi,et al. Anytime pack search , 2015, Natural Computing.