881 citations · 1.4k across the 15 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.AI2013★ 10 cited
Monte-Carlo Planning: Theoretically Fast Convergence Meets Practical Efficiency
Zohar Feldman, Carmel Domshlak
Popular Monte-Carlo tree search (MCTS) algorithms for online planning, such as epsilon-greedy tree search and UCT, aim at rapidly identifying a reasonably good action, but provide…
cs.AI2013★ 12 cited
Cost-Sharing in Bayesian Knowledge Bases
Solomon Eyal Shimony, Carmel Domshlak, Eugene Santos
Bayesian knowledge bases (BKBs) are a generalization of Bayes networks and weighted proof graphs (WAODAGs), that allow cycles in the causal graph. Reasoning in BKBs requires findin…