- To Max or not to Max: Online Learning for Speeding Up Optimal Planning Carmel Domshlak and Erez Karpas
- Fast Probabilistic Planning Through Weighted Model Counting
- MultiAgent Offline Coordination: Structure and Complexity
- Carnegie Mellon ICAPS 2009 Summer School The Interplay Between
- Journal of Arti cial Intelligence Research ?? (2001) ???{??? Submitted 01/02; published ??/?? Preference-based Constrained Optimization with CP-nets
- Efficient Probabilistic Reasoning in Bayes Nets with Mutual Exclusion and Context Specific Independence
- Structure and Complexity in Planning with Unary Operators Carmel Domshlak and Ronen I. Brafman
- Factored Planning: How, When, and When Not Ronen I. Brafman
- Cost-Sharing Approximations for h+ Vitaly Mirkis and Carmel Domshlak
- Gridbased SensorDCSP R. B ejar 1 , C. Dohmslak 2 , C. Fern andez 1 , C. Gomes 2 , B. Selman 2 and M. Valls 3
- ICAPS-09 Summer School on Automated Planning & Scheduling
- Quantitative Reasoning onQuantitative Reasoning on Qualitative PreferencesQualitative Preferences
- CostSharing in Bayesian Knowledge Bases Solomon Eyal Shimony and Carmel Domshlak
- Navigating in the Dark: Modeling Uncertainty in Ad Hoc Retrieval Using Multiple Relevance
- Learning to Combine Admissible Heuristics Under Bounded Time Carmel Domshlak and Erez Karpas
- Optimal Additive Composition of Abstraction-based Admissible Heuristics
- Cost-Optimal Planning with Landmarks Erez Karpas and Carmel Domshlak
- Structural Patterns Heuristics via Fork Decomposition Michael Katz and Carmel Domshlak
- Structural Patterns Heuristics via Fork Decomposition Technical Report IS/IE-2008-03
- Cost-Sharing Approximations for h+ Vitaly Mirkis & Carmel Domshlak
- Fast Probabilistic Planning Through Weighted Model Counting Carmel Domshlak
- Transferable Utility Planning Games Ronen I. Brafman
- From One to Many: Planning for Loosely Coupled Multi-Agent Systems Ronen I. Brafman
- Structural Patterns of Tractable Sequentially-Optimal Planning Michael Katz and Carmel Domshlak
- STRUCTURAL PATTERNS OF TRACTABLE SEQUENTIALLY-OPTIMAL PLANNING
- Factored Planning: How, When, and When Not Carmel Domshlak -Technion, Israel
- Preferences over Sets R. I. Brafman
- Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
- Rank Aggregation for Automatic Schema Carmel Domshlak
- Representing, Eliciting, and Reasoning with Preferences
- Optimal Additive Composition of Abstraction-based Admissible Heuristics Michael Katz and Carmel Domshlak
- TCP-nets for Preferences over Sets
- Carmel Domshlak ID: 304532005
- Friends or Foes? An AI Planning Perspective on Abstraction and Search Jorg Hoffmann
- When Abstractions Met Landmarks Carmel Domshlak and Michael Katz and Sagi Lefler
- Complexity of Probabilistic Reasoning in Directed-Path Singly Connected Bayes Networks
- Structural-Pattern Databases Michael Katz and Carmel Domshlak
- Graphical Modeling of Qualitative Preferences
- Better than the real thing? Iterative pseudo-query processing using cluster-based language models
- Compact Value-Function Representations for Qualitative Preferences Ronen I. Brafman
- Unstructuring User Preferences Efficient Non-parametric
- Command and Control Training Centers: Computer Generated Forces Meet Classical Planning
- Living on the Edge: Safe Search with Unsafe Heuristics Erez Karpas and Carmel Domshlak
