Остановите войну!
for scientists:
default search action
Robert Mateescu
- > Home > Persons > Robert Mateescu
Publications
- 2014
- [i10]Robert Mateescu, Rina Dechter, Radu Marinescu:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. CoRR abs/1401.3448 (2014) - [i9]Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter:
Join-Graph Propagation Algorithms. CoRR abs/1401.3489 (2014) - 2013
- [i7]Rina Dechter, Kalev Kask, Robert Mateescu:
Iterative Join-Graph Propagation. CoRR abs/1301.0564 (2013) - 2012
- [i5]Robert Mateescu, Rina Dechter:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models. CoRR abs/1206.5266 (2012) - [i4]Robert Mateescu, Rina Dechter:
The Relationship Between AND/OR Search and Variable Elimination. CoRR abs/1207.1407 (2012) - [i3]Rina Dechter, Robert Mateescu:
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space. CoRR abs/1207.4119 (2012) - [i2]Rina Dechter, Robert Mateescu:
A Simple Insight into Iterative Belief Propagation's Success. CoRR abs/1212.2463 (2012) - 2010
- [j6]Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter:
Join-Graph Propagation Algorithms. J. Artif. Intell. Res. 37: 279-328 (2010) - 2008
- [j3]Robert Mateescu, Rina Dechter:
Mixed deterministic and probabilistic networks. Ann. Math. Artif. Intell. 54(1-3): 3-51 (2008) - [j2]Robert Mateescu, Rina Dechter, Radu Marinescu:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. J. Artif. Intell. Res. 33: 465-519 (2008) - [c14]Robert Mateescu, Rina Dechter:
AND/OR Multi-valued Decision Diagrams for Constraint Networks. Concurrency, Graphs and Models 2008: 238-257 - 2007
- [j1]Rina Dechter, Robert Mateescu:
AND/OR search spaces for graphical models. Artif. Intell. 171(2-3): 73-106 (2007) - [c12]Robert Mateescu, Radu Marinescu, Rina Dechter:
AND/OR Multi-valued Decision Diagrams for Constraint Optimization. CP 2007: 498-513 - [c11]Robert Mateescu, Rina Dechter:
A Comparison of Time-Space Schemes for Graphical Models. IJCAI 2007: 2346-2352 - [c10]Robert Mateescu, Rina Dechter:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models. UAI 2007: 276-284 - 2006
- [c9]Robert Mateescu, Rina Dechter:
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs). CP 2006: 329-343 - 2005
- [c8]Robert Mateescu, Rina Dechter:
AND/OR Search Spaces and the Semantic Width of Constraint Networks. CP 2005: 860 - [c7]Robert Mateescu, Rina Dechter:
AND/OR Cutset Conditioning. IJCAI 2005: 230-235 - [c6]Robert Mateescu, Rina Dechter:
The Relationship Between AND/OR Search and Variable Elimination. UAI 2005: 380-387 - 2004
- [c5]Rina Dechter, Robert Mateescu:
The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting. CP 2004: 731-736 - [c4]Rina Dechter, Robert Mateescu:
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space. UAI 2004: 120-129 - 2003
- [c3]Rina Dechter, Robert Mateescu:
A Simple Insight into Iterative Belief Propagation's Success. UAI 2003: 175-183 - 2002
- [c2]Robert Mateescu, Rina Dechter, Kalev Kask:
Tree Approximation for Belief Updating. AAAI/IAAI 2002: 553-559 - [c1]Rina Dechter, Kalev Kask, Robert Mateescu:
Iterative Join-Graph Propagation. UAI 2002: 128-136
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-12-18 20:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint