The following pages link to Carmel Domshlak (Q814530):
Displaying 21 items.
- Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks (Q814531) (← links)
- (Q1397244) (redirect page) (← links)
- FlexiMine --A flexible platform for KDD research and application development (Q1397248) (← links)
- On recursively directed hypercubes (Q1599526) (← links)
- Set-structured and cost-sharing heuristics for classical planning (Q2268919) (← links)
- Graphically structured value-function compilation (Q2389622) (← links)
- On the complexity of planning for agent teams and its implications for single agent planning (Q2446582) (← links)
- Sensor networks and distributed CSP: communication, computation and complexity (Q2457701) (← links)
- Hard and soft constraints for reasoning about qualitative conditional preferences (Q2506235) (← links)
- The Complexity of Optimal Monotonic Planning: The Bad, The Good, and The Causal Graph (Q2871457) (← links)
- Online Speedup Learning for Optimal Planning (Q2905395) (← links)
- Simple Regret Optimization in Online Planning for Markov Decision Processes (Q2921080) (← links)
- Deterministic Oversubscription Planning as Heuristic Search: Abstractions and Reformulations (Q2940591) (← links)
- Efficient probabilistic reasoning in BNs with mutual exclusion and context-specific independence (Q3156891) (← links)
- (Q3624003) (← links)
- (Q3624106) (← links)
- (Q3624180) (← links)
- (Q4411159) (← links)
- (Q4439736) (← links)
- Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings (Q5190260) (← links)
- A Snapshot on Reasoning with Qualitative Preference Statements in AI (Q5190956) (← links)
