Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ronen I. Brafman
2010 – today
- 2013
[j30]Ronen I. Brafman, Carmel Domshlak: On the complexity of planning for agent teams and its implications for single agent planning. Artif. Intell. 198: 52-71 (2013)- [c80]Ronen I. Brafman, Guy Shani, Shlomo Zilberstein: Qualitative Planning under Partial Observability in Multi-Agent Domains. AAAI 2013
- [c79]
- [c78]Ran Taig, Ronen I. Brafman: Compiling Conformant Probabilistic Planning Problems into Classical Planning. ICAPS 2013
- [c77]Amihai Savir, Ronen I. Brafman, Guy Shani: Recommending improved configurations for complex objects with an application in travel planning. RecSys 2013: 391-394
- [i15]Ronen I. Brafman, Carmel Domshlak: Introducing Variable Importance Tradeoffs into CP-Nets. CoRR abs/1301.0558 (2013)
- [i14]Guy Shani, Ronen I. Brafman, David Heckerman: An MDP-based Recommender System. CoRR abs/1301.0600 (2013)
- [i13]Craig Boutilier, Fahiem Bacchus, Ronen I. Brafman: UCP-Networks: A Directed Graphical Representation of Conditional Utilities. CoRR abs/1301.2259 (2013)
- [i12]Craig Boutilier, Ronen I. Brafman, Holger H. Hoos, David Poole: Reasoning With Conditional Ceteris Paribus Preference Statem. CoRR abs/1301.6681 (2013)
- [i11]Craig Boutilier, Ronen I. Brafman, Christopher W. Geib: Structured Reachability Analysis for Markov Decision Processes. CoRR abs/1301.7361 (2013)
- [i10]Raz Nissim, Ronen I. Brafman: Distributed Heuristic Forward Search for Multi-Agent Systems. CoRR abs/1306.5858 (2013)
- 2012
- [j29]Ronen I. Brafman, Guy Shani: Replanning in Domains with Partial Information and Sensing Actions. J. Artif. Intell. Res. (JAIR) 45: 565-600 (2012)
- [c76]
- [c75]
- [c74]Raz Nissim, Ronen I. Brafman: Multi-agent A* for parallel and distributed systems. AAMAS 2012: 1265-1266
- [c73]
- [c72]Raz Nissim, Udi Apsel, Ronen I. Brafman: Tunneling and Decomposition-Based State Reduction for Optimal Planning. ECAI 2012: 624-629
- [c71]
- [i9]Udi Apsel, Ronen I. Brafman: Extended Lifted Inference with Joint Formulas. CoRR abs/1202.3698 (2012)
- [i8]Ronen I. Brafman, Carmel Domshlak, Tanya Kogan: Compact Value-Function Representations for Qualitative Preferences. CoRR abs/1207.4126 (2012)
- [i7]Udi Apsel, Ronen I. Brafman: Exploiting Uniform Assignments in First-Order MPE. CoRR abs/1210.4845 (2012)
- 2011
- [j28]Ronen I. Brafman: Relational preference rules for control. Artif. Intell. 175(7-8): 1180-1193 (2011)
- [c70]Ronen I. Brafman, Carmel Domshlak, Yagil Engel, Zohar Feldman: Planning for Operational Control Systems with Predictable Exogenous Events. AAAI 2011
- [c69]Ronen I. Brafman, Enrico Pilotto, Francesca Rossi, Domenico Salvagnin, Kristen Brent Venable, Toby Walsh: The Next Best Solution. AAAI 2011
- [c68]
- [c67]
- [c66]Guy Shani, Ronen I. Brafman: Replanning in Domains with Partial Information and Sensing Actions. IJCAI 2011: 2021-2026
- [c65]
- [e3]Ronen I. Brafman, Fred S. Roberts, Alexis Tsoukiàs (Eds.): Algorithmic Decision Theory - Second International Conference, ADT 2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings. Lecture Notes in Computer Science 6992, Springer 2011, ISBN 978-3-642-24872-6
- [i6]Craig Boutilier, Ronen I. Brafman: Partial-Order Planning with Concurrent Interacting Actions. CoRR abs/1106.0249 (2011)
- [i5]Ronen I. Brafman, Carmel Domshlak: Structure and Complexity in Planning with Unary Operators. CoRR abs/1106.5256 (2011)
- [i4]Ronen I. Brafman, Moshe Tennenholtz: Learning to Coordinate Efficiently: A Model-based Approach. CoRR abs/1106.5258 (2011)
- [i3]Craig Boutilier, Ronen I. Brafman, Carmel Domshlak, Holger H. Hoos, David Poole: CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements. CoRR abs/1107.0023 (2011)
- [i2]Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony: On Graphical Modeling of Preference and Importance. CoRR abs/1109.6345 (2011)
- 2010
- [c64]Ronen I. Brafman, Carmel Domshlak, Yagil Engel, Moshe Tennenholtz: Transferable Utility Planning Games. AAAI 2010
- [c63]Ronen I. Brafman, Yagil Engel: Decomposed Utility Functions and Graphical Models for Reasoning about Preferences. AAAI 2010
- [c62]Raz Nissim, Ronen I. Brafman, Carmel Domshlak: A general, fully distributed multi-agent planning algorithm. AAMAS 2010: 1323-1330
- [c61]Brian Lee, Savil Srivastava, Ranjitha Kumar, Ronen I. Brafman, Scott R. Klemmer: Designing with interactive example galleries. CHI 2010: 2257-2266
- [c60]Ronen I. Brafman, Francesca Rossi, Domenico Salvagnin, Kristen Brent Venable, Toby Walsh: Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms. KR 2010
- [e2]Ronen I. Brafman, Hector Geffner, Jörg Hoffmann, Henry A. Kautz (Eds.): Proceedings of the 20th International Conference on Automated Planning and Scheduling, ICAPS 2010, Toronto, Ontario, Canada, May 12-16, 2010. AAAI 2010
2000 – 2009
- 2009
- [j27]Ronen I. Brafman, Carmel Domshlak: Preference Handling - An Introductory Tutorial. AI Magazine 30(1): 58-86 (2009)
- [j26]Nicolas Meuleau, Emmanuel Benazera, Ronen I. Brafman, Eric A. Hansen, Mausam: A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains. J. Artif. Intell. Res. (JAIR) 34: 27-59 (2009)
- [j25]Maxim Binshtok, Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony: Generic Preferences over Subsets of Structured Objects. J. Artif. Intell. Res. (JAIR) 34: 133-164 (2009)
- [c59]Ronen I. Brafman, Yagil Engel: Directional Decomposition of Multiattribute Utility Functions. ADT 2009: 192-202
- [c58]Ronen I. Brafman, Carmel Domshlak, Yagil Engel, Moshe Tennenholtz: Planning Games. IJCAI 2009: 73-78
- 2008
- [j24]Ronen I. Brafman, Carmel Domshlak: Graphically structured value-function compilation. Artif. Intell. 172(2-3): 325-349 (2008)
- [j23]Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony: Prioritizing Point-Based POMDP Solvers. IEEE Transactions on Systems, Man, and Cybernetics, Part B 38(6): 1592-1605 (2008)
- [c57]Ronen I. Brafman, Carmel Domshlak: From One to Many: Planning for Loosely Coupled Multi-Agent Systems. ICAPS 2008: 28-35
- [c56]Guy Shani, Pascal Poupart, Ronen I. Brafman, Solomon Eyal Shimony: Efficient ADD Operations for Point-Based Algorithms. ICAPS 2008: 330-337
- [c55]
- [c54]
- 2007
- [c53]Samuel Ieong, Nicolas S. Lambert, Yoav Shoham, Ronen I. Brafman: Near-Optimal Search in Continuous Domains. AAAI 2007: 1158-1163
- [c52]Maxim Binshtok, Ronen I. Brafman, Solomon Eyal Shimony, Ajay Mani, Craig Boutilier: Computing Optimal Subsets. AAAI 2007: 1231-1236
- [c51]Yan Virin, Guy Shani, Solomon Eyal Shimony, Ronen I. Brafman: Scaling Up: Solving POMDPs through Value Based Clustering. AAAI 2007: 1290-1295
- [c50]Yan Virin, Guy Shani, Solomon Eyal Shimony, Ronen I. Brafman: Scaling Up: Solving POMDPs through Value Based Clustering. AAAI 2007: 1910-1911
- [c49]Christian Schröpfer, Maxim Binshtok, Solomon Eyal Shimony, Aviram Dayan, Ronen I. Brafman, Philipp Offermann, Oliver Holschke: Introducing Preferences over NFPs into Service Selection in SOA. ICSOC Workshops 2007: 68-79
- [c48]Nicolas Meuleau, Ronen I. Brafman: Hierarchical Heuristic Forward Search in Stochastic Domains. IJCAI 2007: 2542-2549
- [c47]Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony: Forward Search Value Iteration for POMDPs. IJCAI 2007: 2619-2624
- 2006
- [j22]Jörg Hoffmann, Ronen I. Brafman: Conformant planning via heuristic forward search: A new approach. Artif. Intell. 170(6-7): 507-541 (2006)
- [j21]Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony: On Graphical Modeling of Preference and Importance. J. Artif. Intell. Res. (JAIR) 25: 389-424 (2006)
- [c46]
- [c45]Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony, Y. Silver: Preferences over Sets. AAAI 2006: 1101-1106
- [c44]Jeremy Frank, James Crawford, Lina Khatib, Ronen I. Brafman: Tractable Optimal Competitive Scheduling. ICAPS 2006: 73-82
- [c43]Nicolas Meuleau, Ronen I. Brafman, Emmanuel Benazera: Stochastic Over-Subscription Planning Using Hierarchies of MDPs. ICAPS 2006: 121-130
- [c42]Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony: Prioritizing Point-Based POMDP Solvers. ECML 2006: 389-400
- [e1]Gianni Bosi, Ronen I. Brafman, Jan Chomicki, Werner Kießling (Eds.): Preferences: Specification, Inference, Applications, 27. June - 2. July 2004. Dagstuhl Seminar Proceedings 04271, IBFI, Schloss Dagstuhl, Germany 2006
- 2005
- [j20]Guy Shani, David Heckerman, Ronen I. Brafman: An MDP-Based Recommender System. Journal of Machine Learning Research 6: 1265-1295 (2005)
- [c41]Ronen I. Brafman, Moshe Tennenholtz: Optimal Efficient Learning Equilibrium: Imperfect Monitoring in Symmetric Games. AAAI 2005: 726-731
- [c40]Jörg Hoffmann, Ronen I. Brafman: Contingent Planning via Heuristic Forward Search witn Implicit Belief States. ICAPS 2005: 71-80
- [c39]Ronen I. Brafman, Yuri Chernyavsky: Planning with Goal Preferences and Constraints. ICAPS 2005: 182-191
- [c38]Guy Shani, Ronen I. Brafman, Solomon Eyal Shimony: Model-Based Online Learning of POMDPs. ECML 2005: 353-364
- [c37]Mausam, Emmanuel Benazera, Ronen I. Brafman, Nicolas Meuleau, Eric A. Hansen: Planning with Continuous Resources in Stochastic Domains. IJCAI 2005: 1244-1251
- 2004
- [j19]Ronen I. Brafman, Moshe Tennenholtz: Efficient learning equilibrium. Artif. Intell. 159(1-2): 27-47 (2004)
- [j18]Craig Boutilier, Ronen I. Brafman, Carmel Domshlak, Holger H. Hoos, David Poole: Preference-Based Constrained Optimization with CP-Nets. Computational Intelligence 20(2): 137-157 (2004)
- [j17]Ronen I. Brafman, Yannis Dimopoulos: Extended Semantics and Optimization Algorithms for CP-Networks. Computational Intelligence 20(2): 218-245 (2004)
- [j16]Craig Boutilier, Ronen I. Brafman, Carmel Domshlak, Holger H. Hoos, David Poole: CP-nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements. J. Artif. Intell. Res. (JAIR) 21: 135-191 (2004)
- [j15]Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Shimony: Qualitative decision making in adaptive presentation of structured information. ACM Trans. Inf. Syst. 22(4): 503-539 (2004)
- [j14]Ronen I. Brafman: A simplifier for propositional formulas with many binary clauses. IEEE Transactions on Systems, Man, and Cybernetics, Part B 34(1): 52-59 (2004)
- [c36]Ronen I. Brafman, Jörg Hoffmann: Conformant Planning via Heuristic Forward Search: A New Approach. ICAPS 2004: 355-364
- [c35]Gianni Bosi, Ronen I. Brafman, Jan Chomicki, Werner Kießling: 04271 Abstracts Collection - Preferences: Specification, Inference, Applications. Preferences 2004
- [c34]Ronen I. Brafman, Doron A. Friedman: Adaptive Rich Media Presentations via Preference-Based Constrained Optimization. Preferences 2004
- [c33]
- [c32]
- [c31]Ronen I. Brafman, Carmel Domshlak, Tanya Kogan: Compact Value-Function Representations for Qualitative Preferences. UAI 2004: 51-59
- 2003
- [j13]Ronen I. Brafman, Carmel Domshlak: Structure and Complexity in Planning with Unary Operators. J. Artif. Intell. Res. (JAIR) 18: 315-349 (2003)
- [j12]Ronen I. Brafman, Moshe Tennenholtz: Learning to Coordinate Efficiently: A Model-based Approach. J. Artif. Intell. Res. (JAIR) 19: 11-23 (2003)
- [c30]Ronen I. Brafman, David Heckerman, Guy Shani: Recommendation as a Stochastic Sequential Decision Problem. ICAPS 2003: 164-173
- [c29]Ronen I. Brafman, Yannis Dimopoulos: A New Look at the Semantics and Optimization Methods of CP-Networks. IJCAI 2003: 1033-1038
- 2002
- [j11]Ronen I. Brafman, Moshe Tennenholtz: R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning. Journal of Machine Learning Research 3: 213-231 (2002)
- [c28]Carmel Domshlak, Ronen I. Brafman: Structure and Complexity in Planning with Unary Operators. AIPS 2002: 34-43
- [c27]
- [c26]
- [c25]Ronen I. Brafman, Carmel Domshlak: Introducing Variable Importance Tradeoffs into CP-Nets. UAI 2002: 69-76
- [c24]
- 2001
- [j10]Ronen I. Brafman, Nir Friedman: On decision-theoretic foundations for defaults. Artif. Intell. 133(1-2): 1-33 (2001)
- [j9]Ronen I. Brafman: On Reachability, Relevance, and Resolution in the Planning as Satisfiability Approach. J. Artif. Intell. Res. (JAIR) 14: 1-28 (2001)
- [j8]Craig Boutilier, Ronen I. Brafman: Partial-Order Planning with Concurrent Interacting Actions. J. Artif. Intell. Res. (JAIR) 14: 105-136 (2001)
- [c23]Ronen I. Brafman: A Simplifier for Propositional Formulas with Many Binary Clauses. IJCAI 2001: 515-522
- [c22]Ronen I. Brafman, Moshe Tennenholtz: R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning. IJCAI 2001: 953-958
- [c21]Carmel Domshlak, Ronen I. Brafman, Solomon Eyal Shimony: Preference-Based Configuration of Web Page Content. IJCAI 2001: 1451-1456
- [c20]Craig Boutilier, Fahiem Bacchus, Ronen I. Brafman: UCP-Networks: A Directed Graphical Representation of Conditional Utilities. UAI 2001: 56-64
- 2000
- [j7]Ronen I. Brafman, Moshe Tennenholtz: A near-optimal polynomial time algorithm for learning in certain classes of stochastic games. Artif. Intell. 121(1-2): 31-47 (2000)
- [j6]Ronen I. Brafman, Moshe Tennenholtz: An axiomatic treatment of three qualitative decision criteria. J. ACM 47(3): 452-482 (2000)
- [c19]Carmel Domshlak, Ronen I. Brafman: Strucutre and Complexitiy in Planning with Unary Operators. PuK 2000
1990 – 1999
- 1999
- [c18]Ronen I. Brafman, Moshe Tennenholtz: A Near-Optimal Poly-Time Algorithm for Learning a class of Stochastic Games. IJCAI 1999: 734-739
- [c17]Ronen I. Brafman: Reachability, Relevance, Resolution and the Planning as Satisfiability Approach. IJCAI 1999: 976-981
- [c16]
- [c15]Craig Boutilier, Ronen I. Brafman, Holger H. Hoos, David Poole: Reasoning With Conditional Ceteris Paribus Preference Statements. UAI 1999: 71-80
- 1998
- [j5]Ronen I. Brafman, Joseph Y. Halpern, Yoav Shoham: On the Knowledge Requirements of Tasks. Artif. Intell. 98(1-2): 317-349 (1998)
- [c14]Craig Boutilier, Ronen I. Brafman, Christopher W. Geib: Structured Reachability Analysis for Markov Decision Processes. UAI 1998: 24-32
- 1997
- [j4]Ronen I. Brafman, Moshe Tennenholtz: Modeling Agents as Qualitative Decision Makers. Artif. Intell. 94(1-2): 217-268 (1997)
- [j3]Ronen I. Brafman, Jean-Claude Latombe, Yoram Moses, Yoav Shoham: Applications of a logic of knowledge to motion planning under uncertainty. J. ACM 44(5): 633-668 (1997)
- [j2]Ronen I. Brafman: A First-Order Conditional Logic with Qualitative Statistical Semantics. J. Log. Comput. 7(6): 777-803 (1997)
- [c13]Ronen I. Brafman, Moshe Tennenholtz: On the Axiomatization of Qualitative Decision Criteria. AAAI/IAAI 1997: 76-81
- [c12]Craig Boutilier, Ronen I. Brafman: Planning with Concurrent Interacting Actions. AAAI/IAAI 1997: 720-726
- [c11]
- [c10]Craig Boutilier, Ronen I. Brafman, Christopher W. Geib: Prioritized Goal Decomposition of Markov Decision Processes: Toward a Synthesis of Classical and Decision Theoretic Planning. IJCAI 1997: 1156-1162
- 1996
- [j1]Ronen I. Brafman, Moshe Tennenholtz: On Partially Controlled Multi-Agent Systems. J. Artif. Intell. Res. (JAIR) 4: 477-507 (1996)
- [c9]Ronen I. Brafman, Moshe Tennenholtz: On the Foundations of Qualitative Decision Theory. AAAI/IAAI, Vol. 2 1996: 1291-1296
- [c8]
- [i1]Ronen I. Brafman, Moshe Tennenholtz: On Partially Controlled Multi-Agent Systems. CoRR cs.AI/9606102 (1996)
- 1995
- [c7]Ronen I. Brafman, Yoav Shoham: Knowledge Considerations in Robotics and Distribution of Robotic Tasks. IJCAI 1995: 96-102
- [c6]Ronen I. Brafman, Nir Friedman: On Decision-Theoretic Foundations for Defaults. IJCAI 1995: 1458-1465
- [c5]Ronen I. Brafman, Moshe Tennenholtz: Towards Action Prediction Using a Mental-Level Model. IJCAI 1995: 2010-2016
- [c4]Ronen I. Brafman, Yoav Shoham: Knowledge Considerations in Robotics. Reasoning with Uncertainty in Robotics 1995: 248-262
- 1994
- [c3]
- [c2]Ronen I. Brafman, Jean-Claude Latombe, Yoram Moses, Yoav Shoham: Knowledge as a Tool in Motion Planning and Uncertainty. TARK 1994: 208-224
- 1993
- [c1]Ronen I. Brafman, Jean-Claude Latombe, Yoav Shoham: Towards Knowledge-Level Analysis of Motion Planning. AAAI 1993: 670-675
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17 21:27 CEST by the dblp team