Kambhampati, Subbarao - Department of Computer Science and Engineering, Arizona State University

• Cost Based Satisficing Search Considered Harmful William Cushing and J. Benton and Subbarao Kambhampati
• SMARTINT: Using Mined Attribute Dependencies to Integrate Fragmented Web Databases
• SourceRank: Relevance and Trust Assessment for Deep Web Sources Based on Inter-Source Agreement
• SourceRank: Relevance and Trust Assessment for Deep Web Sources Based on Inter-Source Agreement
• SMARTINT: A System for Answering Queries over Web Databases Using Attribute Dependencies
• Learning User Plan Preferences Obfuscated by Feasibility Constraints Nan Li, William Cushing, Subbarao Kambhampati
• Finding and Exploiting Goal Opportunities in Real-time during Plan Execution Paul Schermerhorn, J. Benton, Matthias Scheutz, Kartik Talamadupula, and Subbarao Kambhampati
• Learning Probabilistic Hierarchical Task Networks to Capture User Preferences Nan Li, Subbarao Kambhampati, and Sungwook Yoon
• This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
• Explanation Based Learning For Planning Subbarao Kambhampati (Arizona State University)
• Replanning as a Deliberative Re-selection of Objectives William Cushing and J. Benton and Subbarao Kambhampati
• Probabilistic Planning via Determinization in Hindsight Sungwook Yoon
• Fluent Merging: A General Technique to Improve Reachability Heuristics and Factored Planning
• An LP-Based Heuristic for Optimal Planning Menkes van den Briel1
• A Hybrid Linear Programming and Relaxed Plan Heuristic for Partial Satisfaction Planning Problems
• The primary revolution in automated planning in the last decade has been the very impressive scale-
• QPIAD: Query Processing over Incomplete Autonomous Databases Hemal Khatri Jianchun Fan Yi Chen Subbarao Kambhampati
• Relevance and Overlap Aware Text Collection BHAUMIK CHOKSHI , JOHN (WES) DYER , THOMAS HERNANDEZ
• Planning with Goal Utility Dependencies Embedded Reasoning Area
• Answering Imprecise Queries over Web Databases Ullas Nambiar & Subbarao Kambhampati
• The Case for Automated Planning in Autonomic Computing Biplav Srivastava
• Improving Text Collection Selection with Coverage and Overlap Statistics
• Effective Approaches for Partial Satisfaction (Over-Subscription) Planning Menkes van den Briel, Romeo Sanchez, Minh B. Do, and Subbarao Kambhampati
• Integration of Biological Sources: Current Systems and Challenges Ahead
• Over-Subscription in Planning: a Partial Satisfaction Problem Menkes van den Briel, Romeo Sanchez, and Subbarao Kambhampati
• Journal of Artificial Intelligence Research 19 (2003) 631-657 Submitted 10/02; published 12/03 : Online Parallelization of Plans with
• Answering Imprecise Database Queries : A Novel Ullas Nambiar
• G u e s t E d i t o r s ' I n t r o d u c t i o n Information Integration
• BibFinder/StatMiner: Effectively Mining and Using Coverage and Overlap Statistics in Data Integration
• heuristics, based on our recent theory (Nguyen and Kambhampati 2000). This heuristic, along
• Sapa: A Domain-Independent Heuristic Metric Temporal Planner
• Solving planning-graph by compiling it into CSP Minh Binh Do & Subbarao Kambhampati
• Distance-based Goal-ordering heuristics for Graphplan Subbarao Kambhampati & Romeo Sanchez Nigenda
• On the utility of Plan-space (Causal) Encodings Amol D. Mali & Subbarao Kambhampati
• Optimizing Recursive Information Gathering Plans Eric Lambrecht Subbarao Kambhampati Senthil Gnanaprakasam
• Hybrid Planning for Partially Hierarchical Domains Subbarao Kambhampati
• Frugal Propositional Encodings for Planning Amol D. Mali, Subbarao Kambhampati
• Re nement-based Planning As Satis ability Amol D. Mali, Subbarao Kambhampati
• A Structured Approach for Synthesizing Planners from Specifications Biplav Srivastava Subbarao Kambhampati
• Proceedings of DETC'97 1997 ASME Design Engineering Technical Conferences
• Refinement Planning 1 Kambhampati Refinement Planning as a unifying framework
• On the role of Disjunctive Representations and Constraint Propagation in Refinement Planning
• On the role of Disjunctive Representations and Constraint Propagation
• Today, I will be talking about refinement planning, the dominant paradigm for plan synthesis in artificial intelligence.
• A Candidate Set based analysis of Subgoal Interactions in conjunctive goal planning Subbarao Kambhampati, Laurie Ihrig and Biplav Srivastava
• On the Nature and Role of Modal Truth Criteria in Subbarao Kambhampatia 1
• Planning and Scheduling Thomas Dean, Brown University
• AI Planning: A Prospectus on theory and applications Subbarao Kambhampati, Arizona State University (rao@asu.edu)
• Admissible Pruning Strategies based on plan for Plan-Space Planning
• An Explanation-Based Approach to Improve Retrieval in Case-Based Planning
• Automatic Storage and Indexing of Plan Derivations based on Replay Failures
• Learning Search Control rules for Plan-space Planners: Factors affecting the performance
• Plan-space vs. State-space Planning in Reuse Laurie Ihrig & Subbarao Kambhampati
• To appear in Proc. Principles of Knowledge Rep. and Reasoning (KRR), May 1994 Refinement Search as a Unifying Framework for analyzing Planning Algorithms
• To appear in Proc. 2nd Intl. Conf. on AI Planning Systems (AIPS-94) May, 1994 Design Tradeoffs in Partial Order (Plan Space) Planning
• A Unified Framework for Explanation-Based Generalization of Partially Ordered and Partially
• Formalizing a Spectrum of Plan Generalizations Based on Modal Truth Criteria
• To appear in Proceedings of IJCAI-93 On the Utility of Systematicity: Understanding Tradeoffs between
• Characterizing Multi-Contributor Causal Structures for Planning Subbarao Kambhampati
• Artificial Intelligence 55 (1992) 193-258 193 A validation-structure-based
• bining Specialize al me ers: Subbarao Kambhampati' Mask Cutkosky2 arty Tenenbaum3 Soo
• IEEE JOURNAL OF ROBOTICS AND AUTOMATION, VOL. RA-2, NO. 3, SEPTEMBER 1986 135 Multiresolution Path Planning for Mobile Robots
• Research Statement Subbarao Kambhampati
• Subbarao Kambhampati Arizona State University
• Wired News: Airlines Try Smarter Boarding http://wired.com/news/technology/0,70689-0.html?tw=wn_index_1 1 of 3 5/9/2006 1:06 PM
• Planning Graph Based Reachability Heuristics
• PlanningGraphBased ReachabilityHeuristics
• AltAlt: Combining the Advantages of Graphplan and Heuristic State Search
• 5HFHQW5HFHQW $$GYGYDDQQFFHHVV LLQ $,Q $, 33OODDQQQQLLQQJ $J $ 88QQLLIILLHG 9HG 9LLHHZZ 6XEE6XEEDDUUDDRR .DPEK.DPEKDDPSPSDDWWLL
• 55HHFFHQHQWW $$GYGYDDQFQFHV LHV LQQ $,$, 33OODDQQQQLLQQJ $J $ 88QLILQLILHHGG 9LH9LHZZ 66XXEEEEDUDRDUDR .D.DPPEEKDPKDPSSDWLDWL
• Preferences and Partial Satisfaction in Planning
• Kambhampati & Knoblock Information Integration on the Web (SA-2) 1 Information Integration on the Web
• The Center for Nanotechnology in Society at Arizona State University (CNS-ASU) facilitates the involvement of the general public in nanoscale research and development, to build new capabilities for understanding and
• Professors braving frontiers of Web to expand c... http://www.azcentral.com/arizonarepublic/news/a... 1 of 4 3/4/2007 8:10 PM
• Professors using blogs, podcasts as teaching to... http://www.tucsoncitizen.com/daily/local/41737.php 1 of 3 2/13/2007 9:26 AM
• Californianonline E Technology Trends -Persona... http://californianonline.gns.gannett.com/apps/p... 1 of 4 3/4/2007 8:09 PM
• Page 1 of 14 3/12/2005mhtml:file://C:\Program%20Files\Qualcomm\Eudora\attach\aima.eecs.berkeley....
• Department of Comp. Sci. & Engineering Phone: (480) 965-2735 Brickyard Suite 501
• Factal: Integrating Deep Web Based on Trust and Raju Balakrishnan, and Subbarao Kambhampati
• 15 HOURS 16 HOURS 14 HOURS 15 HOURS13 HOURS 16 HOURS 16 HOURS 15 HOURS Computer Systems Engineering (Information Assurance Concentration), BSE
• 15 HOURS 16 HOURS 14 HOURS 15 HOURS13 HOURS 16 HOURS 16 HOURS 15 HOURS PrerequisitePrerequisite
• School of Computing, Informatics and Decision Systems Engineering Faculty Research Publications, Year 2009
• School of Computing, Informatics and Decision Systems Engineering Faculty Research Publications, Year 2009
• Towards Model-lite Planning: A Proposal For Learning & Planning with Incomplete Domain Models
• What Landmarks Are How Landmarks Are Discovered
• : PDDL3 Simple Preferences as Partial Satisfaction Planning J. Benton & Subbarao Kambhampati
• IPPLAN: Planning as Integer Programming Menkes van den Briel
• Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics The current best conformant probabilistic planners encode
• Planning for Human-Robot Teaming in Open Worlds
• Planning for Human-Robot Teaming Kartik Talamadupula
• Designing and Evaluating an XPath Dialect for Linguistic Queries Steven Bird
• Artificial Intelligence 76 (1995) 167-238 Intelligence
• An Ensemble Learning and Problem Solving Architecture for Airspace Management
• Appears in the working notes of AAAI-94 Workshop on Comparative Analysis of Planning Systems Comparing Partial Order Planning and Task Reduction Planning
• Planning with Preferences and Trajectory Constraints by Integer Programming
• Replanning: a New Perspective William Cushing and Subbarao Kambhampati
• Planning with Partial Preference Models Tuan A. Nguyen
• Improving Graphplan's search with EBL & DDB Techniques Subbarao Kambhampati
• Frugal Propositional Encodings for Planning \Lambda Amol D. Mali, Subbarao Kambhampati
• c \PsiI# g## N## a# G #i# #k## G# \Psid# \Psi## Q#
• Improving Determinization in Hindsight for On-line Probabilistic Planning Embedded Reasoning Area
• Appears in the Proceedings of AAAI-94 Workshop on Case-based Reasoning, 1994 Evaluating the Effectiveness of Derivation Replay in
• A Frequency-based Approach for Mining Coverage Statistics in Data Integration Zaiqing Nie & Subbarao Kambhampati
• Noname manuscript No. (will be inserted by the editor)
• Unifying Classical Planning Approaches Subbarao Kambhampati \Lambda & Biplav Srivastava
• Characterizing MultiContributor Causal Structures for Planning Subbarao Kambhampati
• Planning with Partial Preference Models Tuan A. Nguyen
• SourceRank: Relevance and Trust Assessment for Deep Web Sources Based on Inter-Source Agreement
• Integrating a Closed World Planner and an Open World Robot Kartik Talamadupula
• Multi-Objective Query Processing for Data Aggregation
• On the Nature and Role of Modal Truth Criteria in Subbarao Kambhampati a;1 and Dana S. Nau b
• Admissible Pruning Strategies based on plan for PlanSpace Planning
• Refinement Planning: Status and Prospectus Subbarao Kambhampati \Lambda
• Unifying Classical Planning Approaches Subbarao Kambhampati & Biplav Srivastava
• To appear in Proc. 12th Natl. Conf. on Artificial Intelligence (AAAI-94), August, 1994 Learning Explanation-Based Search Control Rules For Partial Order Planning
• School of Computing, Informatics, and Decision Systems Engineering MASTERS RESEARCH/THESIS PROPOSAL
• Refinementbased Planning As Satisfiability \Lambda Amol D. Mali, Subbarao Kambhampati
• Design and Implementation of a Replay Framework based on a Partial Order Planner \Lambda
• An Iterative and Interactive Approach for Process Suresh Batchu, Subbarao Kambhampati, Hirode Kartheek & Jami Shah \Lambda
• Planning -Scheduling Connections through Exogenous Events Minh B. Do & Subbarao Kambhampati
• Providing Ranked Relevant Results for Web Database Ullas Nambiar
• This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and
• Domain Independent Approaches for Finding Diverse Plans Biplav Srivastava Tuan A. Nguyen Alfonso Gerevini
• A Candidate Set based analysis of Subgoal Interactions in conjunctive goal planning Subbarao Kambhampati \Lambda , Laurie Ihrig and Biplav Srivastava
• Statistical learning Chapter 20 of "AI: a Modern Approach", Sections 13
• An Online Learning Method for Improving Over-subscription Planning Sungwook Yoon
• BibFinder/StatMiner Architecture
• Supporting Queries with Imprecise Constraints Ullas Nambiar
• 16 HOURS 16 HOURS 14 HOURS 15 HOURS13 HOURS 16 HOURS 16 HOURS 15 HOURS Students admitted to ASU starting fall 2007 semester will use critical requirements to obtain advancement to upper-division Computer Science and Engineering courses. Advancement
• AltAlt: Combining the Advantages of Graphplan and Heuristic State Search
• Evaluating Temporal Planning Domains William Cushing
• Encoding HTN Planning in Propositional Logic \Lambda Amol D. Mali and Subbarao Kambhampati
• Automatic Storage and Indexing of Plan Derivations based on Replay Failures
• Planning the Project Management Way: Ecient Planning by E ective Integration of
• Journal of Artificial Intelligence Research 22 (2006) 1-62 Submitted 8/05; published 2/06 Planning Graph Heuristics for Belief Space Search
• Using Memory to Transform Search on the Planning Graph Terry Zimmerman zim@asu.edu
• Figure 1. State space view of Graphplan's search space: 3 consecutive search episodes leading to a solution
• A Structured Approach for Synthesizing Planners from Specifications Biplav Srivastava Subbarao Kambhampati
• home in the Ira A. Fulton
• Are We Comparing Dana and Fahiem or SHOP and TLPlan? A Critique of the Knowledge-based Planning Track at ICP
• Over-Subscription Planning with Numeric Goals Computer Sci. & Eng. Dept.
• Parallelizing State Space Plans Online Romeo Sanchez Nigenda & Subbarao Kambhampati
• State Agnostic Planning Graphs: Deterministic, Non-Deterministic, and Probabilistic Planning
• SourceRank: Relevance and Trust Assessment for Deep Web Sources Based on Inter-Source Agreement
• Enhancing Search for Satisficing Temporal Planning with Objective-driven Decisions
• Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning
• Mining Approximate Functional Dependencies and Concept Similarities to Answer Imprecise Queries
• We present a method for exploiting the symmetry in the planning graph structure and certain redun
• Appears in the Proceedings of AAAI94 Workshop on Casebased Reasoning, 1994 Evaluating the Effectiveness of Derivation Replay in
• On the role of Disjunctive Representations and Constraint Propagation
• To appear in Proc. Principles of Knowledge Rep. and Reasoning (KRR), May 1994 Refinement Search as a Unifying Framework for analyzing Planning Algorithms
• Formalizing a Spectrum of Plan Generalizations Based on Modal Truth Criteria
• A Comparative analysis of Partial Order Planning and Task Reduction Planning Subbarao Kambhampati \Lambda
• Blogs, podcasts encourage 24/7 classroom | Indy... http://www.indystar.com/apps/pbcs.dll/article?A... 1 of 3 3/4/2007 8:08 PM
• AI Planning: A Prospectus on theory and applications Subbarao Kambhampati, Arizona State University (rao@asu.edu)
• Model-lite Planning for the Web Age Masses: The Challenges of Planning with Incomplete and Evolving Domain Models
• To appear in Proceedings of AAAI-93 Relative Utility of EBG based Plan Reuse
• To appear in Proceedings of IJCAI93 On the Utility of Systematicity: Understanding Tradeoffs between
• Optimizing Recursive Information Gathering Plans Eric Lambrecht Subbarao Kambhampati Senthil Gnanaprakasam \Lambda
• An ExplanationBased Approach to Improve Retrieval in CaseBased Planning
• To appear in Proc. 12th Natl. Conf. on Artificial Intelligence (AAAI94), August, 1994 On the Nature of Modal Truth Criteria in Planning \Lambda
• Refinement Planning: Status and Prospectus Subbarao Kambhampati
• Scale-up Revolution in Automated Planning (Or 1001 Ways to Skin a Planning Graph for Heuristic Fun & Profit)
• Subbarao Karnbhampati* Center for Design Research Sterling Federal Systems
• On the role of Disjunctive Representations and Constraint Propagation in Refinement Planning
• Failure Driven Dynamic Search Control for Partial Order Planners: An Explanation based approach
• RealPlan: Decoupling Causal and Resource Reasoning in Planning Biplav Srivastava
• Planning as Constraint Satisfaction: Solving the planning graph by compiling it
• Universal Classical Planner: An algorithm for unifying State-space and Plan-space planning
• Multi-Objective Query Processing for Data Aggregation
• Havasu: A Multi-Objective, Adaptive Query Processing Framework for Web Data Integration
• Reviving Partial Order Planning XuanLong Nguyen & Subbarao Kambhampati
• The Enquirer -Learning by blog, podcast http://news.enquirer.com/apps/pbcs.dll/article?... 1 of 4 3/5/2007 6:37 AM
• SourceRank: Relevance and Trust Assessment for Deep Web Sources Based on Inter-Source Agreement
• To appear in Proc. IJCAI 95 Admissible Pruning Strategies based on plan minimality
• Classical Planning: Compilation of notes from a
• To appear in Proceedings of AAAI93 Relative Utility of EBG based Plan Reuse
• A Snapshot of Public Web Services Jianchun Fan & Subbarao Kambhampati
• Kambhampati & Knoblock Information Integration on the Web (MA-1) 1 Information Integration on the Web
• Helping Satisfy Multiple Objectives During a Service Desk Conversation
• SourceRank: Relevance and Trust Assessment for Deep Web Sources Based on Inter-Source Agreement
• Design and Implementation of a Replay Framework based on a Partial Order Planner
• Planning as Refinement Search: A unified framework for comparative analysis of Search Space Size and
• Improving Graphplan's search with EBL & DDB Techniques Subbarao Kambhampati \Lambda
• 2/19/2008 1 Minh Do, Terry Zimmerman, and
• Using Memory to Transform Search on the Planning Graph Terry Zimmerman zim@asu.edu
• AltAlt: Combining the Advantages of Graphplan and Heuristic State Search
• Planning in Concurrent Domains Subbarao Kambhampati \Lambda
• Refinement Planning 1 Kambhampati Refinement Planning as a unifying framework
• Journal of Artificial Intelligence Research 12 (2000) 134 Submitted 7/99; published 2/00 Planning Graph as a (Dynamic) CSP
• To appear in Proc. 12th Natl. Conf. on Artificial Intelligence (AAAI-94), August, 1994 Derivation Replay for Partial-Order Planning
• On the Self-Similarity of Web Query Traffic: Evidence, Cause and Performance Implications
• Computing agreement requires record linkage Value similarity : SoftTFIDF with Jaro-Winkler.
• On the relations between Intelligent Backtracking and Failure-driven Explanation Based Learning in Constraint
• Theadvertiser E Technology Trends -Personal Te... http://theadvertiser.gns.gannettonline.com/apps... 1 of 5 3/4/2007 8:15 PM
• Finding Inter-Related Plans Biplav Srivastava
• Distancebased Goalordering heuristics for Graphplan Subbarao Kambhampati \Lambda & Romeo Sanchez Nigenda
• Appears in the working notes of AAAI94 Workshop on Comparative Analysis of Planning Systems Comparing Partial Order Planning and Task Reduction Planning
• In the last three years, several ``radically new'' and promising approaches have been developed for tackling
• Hybrid Planning for Partially Hierarchical Domains Subbarao Kambhampati \Lambda , Amol Mali & Biplav Srivastava
• Hierarchical Strategy Learning with Hybrid Representations Sungwook Yoon
• Artificial Intelligence 135 (2002) 73123 Planning graph as the basis for deriving heuristics
• Classical Planning: Compilation of notes from a
• Enhancing Search for Satisficing Temporal Planning with Objective-driven Decisions
• Optimal Ad Ranking for Profit Maximization Raju Balakrishnan
• Gbase Gbase-Domain SourceRank Coverage Coverage SourceRank CORI SR-Coverage SR-CORI
• To appear in Proc. 12th Natl. Conf. on Artificial Intelligence (AAAI-94), August, 1994 On the Nature of Modal Truth Criteria in Planning
• Planning Graph Heuristics for Selecting Objectives in Over-subscription Planning Problems
• RealPlan: Decoupling Causal and Resource Reasoning in Planning Biplav Srivastava
• 15 HOURS 16 HOURS 16 HOURS 15 HOURS16 HOURS 15 HOURS 15 HOURS 12 HOURS Engineering Management, BSE
• Frequency-Based Coverage Statistics Mining for Data Integration Zaiqing Nie & Subbarao Kambhampati
• Universal Classical Planner: An algorithm for unifying Statespace and Planspace planning
• Today, I will be talking about refinement planning, the dominant paradigm for plan synthesis in artificial intelligence.
• On the utility of Planspace (Causal) Encodings Amol D. Mali & Subbarao Kambhampati \Lambda
• We present a method for exploiting the symmetry in the planning graph structure and certain redun-
• Failure Driven Dynamic Search Control for Partial Order Planners: An Explanation based approach
• Journal of Artificial Intelligence Research 31 (2008) 217-257 Submitted 09/07; published 02/08 Loosely Coupled Formulations for Automated Planning: An
• Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning
• Optimizing sourcecall ordering in Information Gathering Plans Subbarao Kambhampati \Lambda & Senthil Gnanaprakasam
• Solving planninggraph by compiling it into CSP Minh Binh Do \Lambda & Subbarao Kambhampati
• To appear in Proc. 12th Natl. Conf. on Artificial Intelligence (AAAI94), August, 1994 Derivation Replay for PartialOrder Planning
• Journal of Artificial Intelligence Research 20 (2003) 155-194 Submitted 10/2002; published 12/2003 Sapa: A Multi-objective Metric Temporal Planner
• Disulphide Connectivity Prediction in Proteins Based on Secondary Structures and Cysteine Separation
• Assessing and Generating Robust Plans with Partial Domain Models Tuan A. Nguyen
• and Retrieval During Plan Reuse: ation Structure Based Approach
• Answering Imprecise Queries over Autonomous Web Databases Ullas Nambiar
• When is Temporal Planning Really Temporal? William Cushing and Subbarao Kambhampati
• Extracting Effective and Admissible State Space Heuristics from the Planning Graph
• AltAlt: Combining the Advantages of Graphplan and Heuristic State Search
• Research Paper: america22 1 Optimizing Recursive Information Gathering Plans
• Distributed Planning 1 Amol D. Mali, Subbarao Kambhampati
• To appear in Proc. IJCAI 95 Admissible Pruning Strategies based on plan minimality
• Appeared in Working notes of AAAI 1990 Spring Symposium on Casebased Reasoning A Classification of Plan Modification Strategies Based on
• Improving the Temporal Flexibility of Position Constrained Metric Temporal Plans Minh B. Do & Subbarao Kambhampati
• G-value Plateaus: A Challenge for Planning and Kartik Talamadupula
• Integrating a Closed World Planner with an Open World Robot: A Case Study Kartik Talamadupula
• Mining, Using and Maintaining Source Statistics for Adaptive Data Integration
• Journal of Artificial Intelligence Research 1 (2005) ?-? Submitted 1/05; published ?/05 Engineering Note
• AltAlt-p: Online Parallelization of Plans with Heuristic State Romeo Sanchez Nigenda & Subbarao Kambhampati
• This Is a Publication of The American Association for Artificial Intelligence
• Academic Advising Manual B. S. Computer Science
• Effectively Mining and Using Coverage and Overlap Statistics for Data Integration
• Bridging the Gap Between Planning and Scheduling David E. Smith, Jeremy Frank1, and Ari K. Jnsson2
• >> dt {Starting with the dt matrix corresponding to the database/statistics running example} 24 21 9 0 0 3
• Research Paper: america22 1 Optimizing Recursive Information Gathering Plans
• Appeared in Working notes of AAAI 1990 Spring Symposium on Casebased Reasoning A Classification of Plan Modification Strategies Based on
• Elicitation, Estimation & Explanation Challenges in Handling Imprecision & Incompleteness in
• VISUAL ALGORITHMS FOR AWTBNOMOUS NAVIGATION Fred P. Andresen
• Planspace vs. Statespace Planning in Reuse Laurie Ihrig & Subbarao Kambhampati
• Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in
• Understanding and Extending Graphplan Subbarao Kambhampati, Eric Parker and Eric Lambrecht
• Heuristic Guidance Measures for Conformant Planning Daniel Bryce & Subbarao Kambhampati
• Finding Admissible Bounds for Over-subscription Planning Problems Dept. of Computer Science and Engineering
• Planning for Human-Robot Teaming in Open KARTIK TALAMADUPULA and J. BENTON and SUBBARAO KAMBHAMPATI
• Call for Papers Keyword Search on Structured Data
• Major Map: Engineering Management Bachelor of Science in Engineering (B.S.E.)
• Encoding HTN Planning in Propositional Logic Amol D. Mali and Subbarao Kambhampati
• Partial Satisfaction (Over-Subscription) Planning as Heuristic Search
• Query Processing over Incomplete Autonomous Databases Garrett Wolf Hemal Khatri
• Extracting Effective and Admissible State Space Heuristics from the Planning Graph
• To appear in Proc. 12th Natl. Conf. on Artificial Intelligence (AAAI94), August, 1994 Learning ExplanationBased Search Control Rules For Partial Order Planning
• Planning as Refinement Search: A unified framework for comparative analysis of Search Space Size and
• Planning Graph as the Basis for Deriving Heuristics for Plan Synthesis by State Space and CSP Search
• In the last three years, several "radically new" and promising approaches have been developed for tackling
• A Frequency-based Approach for Mining Coverage Statistics in Data Integration Zaiqing Nie & Subbarao Kambhampati
• School of Computing, Informatics and Decision Systems Engineering Faculty Research Publications, Year 2009
• Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
• To appear in Proc. 2nd Intl. Conf. on AI Planning Systems (AIPS94) May, 1994 Design Tradeoffs in Partial Order (Plan Space) Planning
• Probabilistic Planning is Multi-objective! Daniel Bryce
• Factal: Integrating Deep Web Based on Trust and Raju Balakrishnan, and Subbarao Kambhampati
• Distributed Planning1 Amol D. Mali, Subbarao Kambhampati
• Planning in Concurrent Domains Subbarao Kambhampati
• ADD EVENTS TO CALENDAR Go to the Fulton Schools of Engineering home page and enter the events page (see below).
• On the relations between Intelligent Backtracking and Failuredriven Explanation Based Learning in Constraint
• Journal of Intelligent Information Systems, 22:2, 119153, 2004 c 2004 Kluwer Academic Publishers. Printed in The United States.
• The New American University ASU: The New American University
• Finding Admissible Bounds for Over-subscription Planning Problems Dept. of Computer Science and Engineering
• Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
• Control of Refitting during Plan Reuse' Subbarao Kambhampati
• Cost Based Search Considered Harmful (Extended Abstract)
• Planning for Human-Robot Teaming Kartik Talamadupula
• MultiContributor Causal Structures for Planning: A Formalization and Evaluation
• Planning for Information Gathering: A Tutorial Survey Eric Lambrecht & Subbarao Kambhampati
• Learning Search Control rules for Planspace Planners: Factors affecting the performance
• A Theory of Plan Modification Subbarao Kambhampati*
• Learning & Planning Subbarao Kambhampati
• Planning Graph-based Heuristics for Cost-sensitive Temporal Planning Minh B. Do & Subbarao Kambhampati
• Mining Coverage Statistics for Websource Selection in a Mediator
• Joint Optimization of Cost and Coverage of Information Gathering Plans
• 15 HOURS 16 HOURS 14 HOURS 15 HOURS13 HOURS 16 HOURS 16 HOURS 15 HOURS PrerequisitePrerequisite
• Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework
• A Comparative analysis of Partial Order Planning and Task Reduction Planning Subbarao Kambhampati
• Integrating a Closed World Planner with an Open World Robot: A Case Study Kartik Talamadupula
• Planning with Goal Utility Dependencies Minh B. Do and J. Benton and Menkes van den Briel and Subbarao Kambhampati
• Understanding and Extending Graphplan Subbarao Kambhampati, Eric Parker and Eric Lambrecht +
• School of Computing and Informatics at Arizona ... http://sci.asu.edu/ 1 of 1 11/18/2007 7:44 PM
• Lossless Compression for Large Scale Cluster Logs Raju Balakrishnan
• Multi-Contributor Causal Structures for Planning: A Formalization and Evaluation
• On-line Anticipatory Planning Department of Computer Science
• AI planning has made impressive advances under several different paradigms of the problem structure and search process. Each view brings its particular strengths to bear on the problem and suffers inherent, relative
• An Iterative and Interactive Approach for Process Suresh Batchu, Subbarao Kambhampati, Hirode Kartheek & Jami Shah
• Journal of Intelligent Information Systems
• School of Computing, Informatics and Decision Systems Engineering Faculty Research Publications, Year 2010
• Ira A. Fulton Schools of Engineering (8/25/11) LATE REGISTRATION TRANSACTIONS
• School of Computing, Informatics and Decision Systems Engineering Faculty Research Publications, Year 2010
• Planning for Agents with Changing Goals Kartik Talamadupula
• School of Computing, Informatics and Decision Systems Engineering Faculty Research Publications, Year 2010
• MINING APPROXIMATE FUNCTIONAL DEPENDENCIES AS CONDENSED REPRESENTATIONS OF ASSOCIATION RULES
• IMPROVING TEXT COLLECTION SELECTION WITH COVERAGE AND OVERLAP STATISTICS
• Assessing Relevance and Trust of the Deep Web Sources and Results Based on Inter-Source Agreement1
• MINING AND USING COVERAGE AND OVERLAP STATISTICS FOR DATA INTEGRATION
• Learning Probabilistic Hierarchical Task Networks as Probabilistic Context-Free Grammars to Capture
• Generating Diverse Plans to Handle Unknown and Partially Known User Preferences
• An Investigation of the Cost and Accuracy Tradeoffs of Supplanting AFDs with Bayes Network in Query Processing in the Presence of Incompleteness in Autonomous Databases
• SCALING UP METRIC TEMPORAL PLANNING A Dissertation Presented in Partial Fulfillment
• PLANNING GRAPH BASED HEURISTICS FOR AUTOMATED PLANNING
• QUERY PROCESSING OVER INCOMPLETE AUTONOMOUS WEB DATABASES Hemal Khatri
• OPTIMIZING RECURSIVE INFORMATION GATHERING PLANS Eric M. Lambrecht
• INTEGER PROGRAMMING APPROACHES FOR AUTOMATED PLANNING Menkes Hector Louis van den Briel
• Topic Sensitive SourceRank: Extending SourceRank for Performing Context-Sensitive Search over Deep Web
• ANSWERING IMPRECISE QUERIES OVER AUTONOMOUS DATABASES Ullas Nambiar
• Agreement Based Source Selection for the Multi-Topic Deep Web Integration
• ADAPTIVE QUERY PROCESSING FOR DATA AGGREGATION: MINING, USING AND MAINTAINING SOURCE STATISTICS
• Relevance and Overlap in Text Resource April 7, 2005
• COMPARING OFFLINE AND ONLINE STATISTICS ESTIMATION FOR TEXT RETRIEVAL FROM OVERLAPPED COLLECTIONS
• SYSTEM R STYLE JOIN ORDER OPTIMIZATION FOR INTERNET INFORMATION Senthil Gnanaprakasam
• Adaptive Sampling Applied to Planning with Hindsight Optimization Alex Wallace
• IMPROVING RETRIEVAL ACCURACY IN WEB DATABASES USING INTRA-TABLE AND INTER-TABLE DEPENDENCIES
• SMART-INT: A SYSTEM FOR ANSWERING QUERIES OVER WEB DATABASES USING ATTRIBUTE DEPENDENCIES
• REAL-TIME CLOSED-LOOP TRACKING OF AN UNKNOWN NUMBER OF NEURAL SOURCES USING PROBABILITY HYPOTHESIS DENSITY PARTICLE FILTERING
• A Framework for Accelerating Neuromorphic-Vision Algorithms on FPGAs
• This work was supported in part by a grant from NSF, CSR 0910699. FLEXIBLE PRODUCT CODE-BASED ECC SCHEMES FOR MLC NAND
• Tell me when and why to do it! Run-time planner model updates via natural language instruction
• A HARDWARE ARCHITECTURE FOR ACCELERATING NEUROMORPHIC VISION A. Al Maashri, M. DeBole, C.-L. Yu
• Journal of Signal Processing Systems manuscript No. (will be inserted by the editor)
• CSE 471/598: Intro to Artificial Intelligence Midterm. Spring 2012. Instructor: Subbarao Kambhampati
• Abstract--This paper presents a novel sum of absolute difference (SAD) scheme that significantly reduces the