Carmel Domshlak

Affiliations:
  • Technion - Israel Institute of Technology, Haifa, Israel


According to our database1, Carmel Domshlak authored at least 88 papers between 1997 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
Blind Search for Atari-Like Online Planning Revisited.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations.
J. Artif. Intell. Res., 2015

Red-black planning: A new systematic approach to partial delete relaxation.
Artif. Intell., 2015

From Fork Decoupling to Star-Topology Decoupling.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

On Interruptible Pure Exploration in Multi-Armed Bandits.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Simple Regret Optimization in Online Planning for Markov Decision Processes.
J. Artif. Intell. Res., 2014

On Combinatorial Actions and CMABs with Linear Side Information.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Landmarks in Oversubscription Planning.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

On Robustness of CMAB Algorithms: Experimental Approach.
Proceedings of the Computer Games - Third Workshop on Computer Games, 2014

Monte-Carlo Tree Search: To MC or to DP?
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

On MABs and Separation of Concerns in Monte-Carlo Planning for MDPs.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

2013
The Complexity of Optimal Monotonic Planning: The Bad, The Good, and The Causal Graph.
J. Artif. Intell. Res., 2013

On the complexity of planning for agent teams and its implications for single agent planning.
Artif. Intell., 2013

Monte-Carlo Planning: Theoretically Fast Convergence Meets Practical Efficiency.
Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

To UCT, or not to UCT? (Position Paper).
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Abstractions for Oversubscription Planning.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Who Said We Need to Relax All Variables?
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Symmetry Breaking: Satisficing Planning and Landmark Heuristics.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Fault Tolerant Planning: Complexity and Compilation.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Red-Black Relaxed Plan Heuristics.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Data-Parallel Computing Meets STRIPS.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Online Speedup Learning for Optimal Planning.
J. Artif. Intell. Res., 2012

Online Planning in MDPs: Rationality and Optimization
CoRR, 2012

Landmark-enhanced abstraction heuristics.
Artif. Intell., 2012

Optimal Search with Inadmissible Heuristics.
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Enhanced Symmetry Breaking in Cost-Optimal Planning as Forward Search.
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

2011
CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements
CoRR, 2011

Preferences in AI: An overview.
Artif. Intell., 2011

Planning for Operational Control Systems with Predictable Exogenous Events.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Implicit Abstraction Heuristics.
J. Artif. Intell. Res., 2010

Optimal admissible composition of abstraction heuristics.
Artif. Intell., 2010

A general, fully distributed multi-agent planning algorithm.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

When Abstractions Met Landmarks.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

To Max or Not to Max: Online Learning for Speeding Up Optimal Planning.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Transferable Utility Planning Games.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings.
J. Artif. Intell. Res., 2009

Generic Preferences over Subsets of Structured Objects.
J. Artif. Intell. Res., 2009

Set-structured and cost-sharing heuristics for classical planning.
Ann. Math. Artif. Intell., 2009

Preference Handling - An Introductory Tutorial.
AI Mag., 2009

Cost-Optimal Planning with Landmarks.
Proceedings of the IJCAI 2009, 2009

Planning Games.
Proceedings of the IJCAI 2009, 2009

Navigating in the Dark: Modeling Uncertainty in Ad Hoc Retrieval Using Multiple Relevance Models.
Proceedings of the Advances in Information Retrieval Theory, 2009

Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
Proceedings of the Graph Search Engineering, 29.11. - 04.12.2009, 2009

Structural-Pattern Databases.
Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2008
On ranking techniques for desktop search.
ACM Trans. Inf. Syst., 2008

New Islands of Tractability of Cost-Optimal Planning.
J. Artif. Intell. Res., 2008

Graphically structured value-function compilation.
Artif. Intell., 2008

A rank-aggregation approach to searching for optimal query-specific clusters.
Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2008

Providing Top-K Alternative Schema Matchings with .
Proceedings of the Conceptual Modeling, 2008

Structural Patterns Heuristics via Fork Decomposition.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

Optimal Additive Composition of Abstraction-based Admissible Heuristics.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

From One to Many: Planning for Loosely Coupled Multi-Agent Systems.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

2007
Efficient and non-parametric reasoning over user preferences.
User Model. User Adapt. Interact., 2007

Rank Aggregation for Automatic Schema Matching.
IEEE Trans. Knowl. Data Eng., 2007

Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting.
J. Artif. Intell. Res., 2007

Towards robust query expansion: model selection in the language modeling framework.
Proceedings of the SIGIR 2007: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2007

Cost-Sharing Approximations for h+.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

Structural Patterns of Tractable Sequentially-Optimal Planning.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

2006
On Graphical Modeling of Preference and Importance.
J. Artif. Intell. Res., 2006

Hard and soft constraints for reasoning about qualitative conditional preferences.
J. Heuristics, 2006

Friends or Foes? An AI Planning Perspective on Abstraction and Search.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

Fast Probabilistic Planning through Weighted Model Counting.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

Preferences over Sets.
Proceedings of the Proceedings, 2006

Factored Planning: How, When, and When Not.
Proceedings of the Proceedings, 2006

2005
Sensor networks and distributed CSP: communication, computation and complexity.
Artif. Intell., 2005

Unstructuring User Preferences: Efficient Non-Parametric Utility Revelation.
Proceedings of the UAI '05, 2005

Better than the real thing?: iterative pseudo-query processing using cluster-based language models.
Proceedings of the SIGIR 2005: Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2005

2004
Qualitative decision making in adaptive presentation of structured information.
ACM Trans. Inf. Syst., 2004

CP-nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements.
J. Artif. Intell. Res., 2004

Efficient probabilistic reasoning in BNs with mutual exclusion and context-specific independence.
Int. J. Intell. Syst., 2004

Preference-Based Constrained Optimization with CP-Nets.
Comput. Intell., 2004

Compact Value-Function Representations for Qualitative Preferences.
Proceedings of the UAI '04, 2004

Multi-Agent Opportunistic Planning and Plan Execution.
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

On the Role of Knowledge in Multi-Agent Opportunism.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

2003
Structure and Complexity in Planning with Unary Operators.
J. Artif. Intell. Res., 2003

FlexiMine - A Flexible Platform for KDD Research and Application Development.
Ann. Math. Artif. Intell., 2003

Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks.
Artif. Intell., 2003

Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques.
Proceedings of the IJCAI-03, 2003

Grid-based SensorDCSP.
Proceedings of the IJCAI-03, 2003

Efficient Probabilistic Reasoning in Bayes Nets with Mutual Exclusion and Context Specific Independence.
Proceedings of the Sixteenth International Florida Artificial Intelligence Research Society Conference, 2003

2002
On Recursively Directed Hypercubes.
Electron. J. Comb., 2002

Introducing Variable Importance Tradeoffs into CP-Nets.
Proceedings of the UAI '02, 2002

CP-nets: Reasoning and Consistency Testing.
Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR-02), 2002

Remote Conferencing with Multimedia Objects.
Proceedings of the XML-Based Data Management and Multimedia Engineering, 2002

2001
Preference-Based Configuration of Web Page Content.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

2000
Strucutre and Complexity in Planning with Unary Operators.
Proceedings of the 14th Workshop "New Results in Planning, 2000

1998
FlexiMine - A Flexible Platform for KDD Research and Application Construction.
Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), 1998

1997
Cost-Sharing in Bayesian Knowledge Bases.
Proceedings of the UAI '97: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 1997


  Loading...