2017 - Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) For significant contributions to algorithms, representation, and theoretical foundations of automated decision making in the areas of preference handling, planning under uncertainty, multi-agent planning, and privacy.
His main research concerns Artificial intelligence, Machine learning, Mathematical optimization, Ceteris paribus and Markov decision process. Ronen I. Brafman is interested in Representation, which is a branch of Artificial intelligence. His research in Machine learning intersects with topics in Domain, Key and Decision analysis.
His work on Heuristic, Heuristic and Minimax as part of general Mathematical optimization study is frequently linked to Intuition, bridging the gap between disciplines. His Ceteris paribus research integrates issues from Interpretation, Mathematical economics and Conditional dependence. His work on Partially observable Markov decision process is typically connected to Wake-sleep algorithm as part of general Markov decision process study, connecting several disciplines of science.
His primary areas of investigation include Artificial intelligence, Mathematical optimization, Theoretical computer science, Markov decision process and Machine learning. In the field of Artificial intelligence, his study on Planner overlaps with subjects such as Class. The Mathematical optimization study combines topics in areas such as Time complexity, Algorithm, Probabilistic logic and Reinforcement learning.
His Theoretical computer science study combines topics in areas such as Structure, Representation, Privacy preserving and Search algorithm. He specializes in Markov decision process, namely Partially observable Markov decision process. His research integrates issues of Ceteris paribus and Information retrieval in his study of Machine learning.
His primary areas of study are Theoretical computer science, State, Action, Artificial intelligence and Privacy preserving. His study in State is interdisciplinary in nature, drawing from both Web service, Markov decision process and Mathematical optimization. While the research belongs to areas of Markov decision process, he spends his time largely on the problem of Reinforcement learning, intersecting his research to questions surrounding If and only if.
Ronen I. Brafman combines subjects such as Simple and Key with his study of Action. His studies examine the connections between Artificial intelligence and genetics, as well as such issues in Machine learning, with regards to Malware. His Privacy preserving study incorporates themes from Multi-agent planning and Search algorithm.
Ronen I. Brafman spends much of his time researching Theoretical computer science, Multi-agent planning, Privacy preserving, Reuse and Key. In general Theoretical computer science study, his work on Nondeterministic algorithm often relates to the realm of Observable and Autonomous robot, thereby connecting several areas of interest. Ronen I. Brafman has included themes like Computer security, Private information retrieval and Algorithm, Search algorithm in his Multi-agent planning study.
The study incorporates disciplines such as Software engineering and Exponential function in addition to Key. Ronen I. Brafman integrates several fields in his works, including Value, Machine learning, Artificial intelligence and Action. His Machine learning research includes themes of Belief structure and Representation.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
R-max - a general polynomial time algorithm for near-optimal reinforcement learning
Ronen I. Brafman;Moshe Tennenholtz.
Journal of Machine Learning Research (2003)
R-max - a general polynomial time algorithm for near-optimal reinforcement learning
Ronen I. Brafman;Moshe Tennenholtz.
Journal of Machine Learning Research (2003)
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements
Craig Boutilier;Ronen I. Brafman;Carmel Domshlak;Holger H. Hoos.
Journal of Artificial Intelligence Research (2004)
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements
Craig Boutilier;Ronen I. Brafman;Carmel Domshlak;Holger H. Hoos.
Journal of Artificial Intelligence Research (2004)
An MDP-Based Recommender System
Guy Shani;David Heckerman;Ronen I. Brafman.
Journal of Machine Learning Research (2005)
An MDP-Based Recommender System
Guy Shani;David Heckerman;Ronen I. Brafman.
Journal of Machine Learning Research (2005)
Reasoning with conditional ceteris paribus preference statements
Craig Boutilier;Ronen I. Brafman;Holger H. Hoos;David Poole.
uncertainty in artificial intelligence (1999)
Reasoning with conditional ceteris paribus preference statements
Craig Boutilier;Ronen I. Brafman;Holger H. Hoos;David Poole.
uncertainty in artificial intelligence (1999)
CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements
C. Boutilier;R. I. Brafman;C. Domshlak;H. H. Hoos.
arXiv: Artificial Intelligence (2011)
CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements
C. Boutilier;R. I. Brafman;C. Domshlak;H. H. Hoos.
arXiv: Artificial Intelligence (2011)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Technion – Israel Institute of Technology
Technion – Israel Institute of Technology
Google (United States)
Stanford University
University of British Columbia
Leiden University
Sapienza University of Rome
Saarland University
Microsoft (United States)
Stanford University
University of Turku
University of Houston
Semiconductor Energy Laboratory (Japan)
Forschungszentrum Jülich
Kent State University
University of Rochester
United States Geological Survey
Colorado State University
University of Chicago
University of Manchester
Peking University
University of Stuttgart
University of New Hampshire
National Institutes of Health
University of British Columbia
University of Amsterdam