Statement Robert Mateescu
نویسنده
چکیده
My research interests are in artificial intelligence. I focus primarily on automated reasoning in graphical models, such as Bayesian networks, constraint networks, Markov networks or influence diagrams, which have become a central paradigm for knowledge representation and reasoning. My goal is to develop efficient algorithms and data structures for such models, both on a theoretical and practical level. The guiding principle of my approach is the exploitation of the structural information revealed by the underlying graphical representation. There are numerous examples of problems defined as graphical models, including design, scheduling, planning, diagnosis, decision making or genetic linkage analysis. Solving such problems is computationally hard, and typically requires handling uncertainty (probabilistic information) or inconsistency (deterministic information). Advances in exact or approximate methods are therefore crucial, with potential impact across many disciplines. I believe that many new improvements are still possible, through an interdisciplinary approach, combining state-of-the-art algorithms and insights from graph theory, probability theory, statistics, statistical physics, artificial intelligence, logic, formal verification or information theory, to name only those which have already played a part in my research so far, as detailed further.
منابع مشابه
1 Tractability and Modern Satisfiability Modulo
1 Tractability and Modern Satisfiability Modulo Theories Solvers page 3 1.
متن کاملMixed Deterministic and Probabilistic Networks A Survey of Recent Results
The paper introduces mixed networks, a new framework for expressing and reasoning with probabilistic and deterministic information. The framework combines belief networks with constraint networks. We define the semantics and graphical representation, outline the primary algorithms for processing mixed networks and provide some empirical demonstration.
متن کاملThe Relationship Between AND/OR Search and Variable Elimination
In this paper we compare search and inference in graphical models through the new framework of AND/OR search. Specifically, we compare Variable Elimination (VE) and memoryintensive AND/OR Search (AO) and place algorithms such as graph-based backjumping and no-good and good learning, as well as Recursive Conditioning [7] and Value Elimination [2] within the AND/OR search framework.
متن کاملA Comparison of Time-Space Schemes
We investigate two parameterized algorithmic schemes for graphical models that can accommodate trade-offs between time and space: 1) AND/OR Cutset Conditioning (AOC(i)) and 2) Variable Elimination with Conditioning (VEC(i)). We show that AOC(i) is better than the vanilla versions of VEC(i), and use the guiding principles of AOC(i) to improve VEC(i). Finally, we show that the improved versions o...
متن کاملThe Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting
The contribution of this paper is in demonstrating the impact of AND/OR search spaces view on solutions counting. In contrast to the traditional (OR) search space view, the AND/OR search space displays independencies present in the graphical model explicitly and may sometimes reduce the search space exponentially. Empirical evaluation focusing on counting demonstrates the spectrum of search and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006