Követés
Ronen Brafman
Ronen Brafman
Department of Computer Science, Ben-Gurion University
E-mail megerősítve itt: cs.bgu.ac.il
Cím
Hivatkozott rá
Hivatkozott rá
Év
R-max-a general polynomial time algorithm for near-optimal reinforcement learning
RI Brafman, M Tennenholtz
Journal of Machine Learning Research 3 (Oct), 213-231, 2002
14732002
An MDP-based recommender system.
G Shani, D Heckerman, RI Brafman, C Boutilier
Journal of machine Learning research 6 (9), 2005
14162005
CP-nets: A tool for representing and reasoning withconditional ceteris paribus preference statements
C Boutilier, RI Brafman, C Domshlak, HH Hoos, D Poole
Journal of artificial intelligence research 21, 135-191, 2004
12462004
Reasoning With Conditional Ceteris Paribus Preference Statements.
C Boutilier, RI Brafman, HH Hoos, D Poole
UAI 99, 71-80, 1999
3681999
From One to Many: Planning for Loosely Coupled Multi-Agent Systems.
RI Brafman, C Domshlak
ICAPS 8, 28-35, 2008
3102008
Contingent planning via heuristic forward search with implicit belief states
J Hoffmann, R Brafman
Proc. ICAPS 2005, 2005
2972005
Conformant planning via heuristic forward search: A new approach
J Hoffmann, RI Brafman
Artificial Intelligence 170 (6-7), 507-541, 2006
2942006
UCP-networks: A directed graphical representation of conditional utilities
C Boutilier, F Bacchus, RI Brafman
arXiv preprint arXiv:1301.2259, 2013
2822013
Preference‐Based Constrained Optimization with CP‐Nets
C Boutilier, RI Brafman, C Domshlak, HH Hoos, D Poole
Computational Intelligence 20 (2), 137-157, 2004
2552004
On graphical modeling of preference and importance
RI Brafman, C Domshlak, SE Shimony
Journal of Artificial Intelligence Research 25, 389-424, 2006
2322006
Designing with interactive example galleries
B Lee, S Srivastava, R Kumar, R Brafman, SR Klemmer
Proceedings of the SIGCHI conference on human factors in computing systems …, 2010
2122010
Partial-order planning with concurrent interacting actions
C Boutilier, RI Brafman
Journal of Artificial Intelligence Research 14, 105-136, 2001
1762001
Introducing variable importance tradeoffs into CP-nets
RI Brafman, C Domshlak
arXiv preprint arXiv:1301.0558, 2012
1712012
Preference handling-an introductory tutorial
R Brafman, C Domshlak
AI magazine 30 (1), 58-58, 2009
1662009
A heuristic variable grid solution method for POMDPs
RI Brafman
AAAI/IAAI, 727-733, 1997
1501997
Factored planning: How, when, and when not
RI Brafman, C Domshlak
AAAI 6, 809-814, 2006
1452006
Forward Search Value Iteration for POMDPs.
G Shani, RI Brafman, SE Shimony
IJCAI, 2619-2624, 2007
1442007
A general, fully distributed multi-agent planning algorithm.
R Nissim, RI Brafman, C Domshlak
AAMAS 10, 1323-1330, 2010
1422010
A simplifier for propositional formulas with many binary clauses
RI Brafman
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 34 …, 2004
1382004
CP-nets: Reasoning and Consistency Testing.
C Domshlak, RI Brafman
Proceedings of the Eights International Conference on Principles and …, 2002
1292002
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20