default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRadu Marinescu 0002
Person information
- affiliation: IBM Research, Dublin, Ireland
- affiliation: Cork Constraint Computation Centre, University College Cork, Cork, Ireland
- affiliation: University of California, Irvine, CA, USA
Other persons with the same name
- Radu Marinescu 0001
![[0000-0002-4698-7192]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-4698-7192")
— University of Timisoara, Romania
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j10]Fábio Gagliardi Cozman, Radu Marinescu, Junkyu Lee, Alexander G. Gray, Ryan Riegel, Debarun Bhattacharjya:
Markov conditions and factorization in logical credal networks. Int. J. Approx. Reason. 172: 109237 (2024)- [i16]Debarun Bhattacharjya, Junkyu Lee, Don Joven Agravante, Balaji Ganesan, Radu Marinescu:
Foundation Model Sherpas: Guiding Foundation Models through Knowledge and Reasoning. CoRR abs/2402.01602 (2024) - [i15]Yufang Hou, Alessandra Pascale, Javier Carnerero-Cano, Tigran T. Tchrakian, Radu Marinescu, Elizabeth Daly, Inkit Padhi, Prasanna Sattigeri:
WikiContradict: A Benchmark for Evaluating LLMs on Real-World Knowledge Conflicts from Wikipedia. CoRR abs/2406.13805 (2024) - 2023
- [c62]Jasmina Gajcin, James McCarthy, Rahul Nair, Radu Marinescu, Elizabeth Daly, Ivana Dusparic:
Iterative Reward Shaping Using Human Feedback for Correcting Reward Misspecification. ECAI 2023: 788-794 - [c61]Achille Fokoue, Ibrahim Abdelaziz, Maxwell Crouse, Shajith Ikbal, Akihiro Kishimoto, Guilherme Lima, Ndivhuwo Makondo, Radu Marinescu:
An Ensemble Approach for Automated Theorem Proving Based on Efficient Name Invariant Graph Neural Representations. IJCAI 2023: 3221-3229 - [c60]Radu Marinescu, Haifeng Qian, Alexander G. Gray, Debarun Bhattacharjya, Francisco Barahona, Tian Gao, Ryan Riegel:
Approximate Inference in Logical Credal Networks. IJCAI 2023: 5694-5701 - [c59]Daniel Karl I. Weidele, Shazia Afzal, Abel N. Valente, Cole Makuch, Owen Cornec, Long Vu, Dharmashankar Subramanian, Werner Geyer, Rahul Nair, Inge Vejsbjerg, Radu Marinescu, Paulito P. Palmes, Elizabeth M. Daly, Loraine Franke, Daniel Haehn:
AutoDOViz: Human-Centered Automation for Decision Optimization. IUI 2023: 664-680 - [c58]Radu Marinescu, Debarun Bhattacharjya, Junkyu Lee, Fábio Gagliardi Cozman, Alexander G. Gray:
Credal Marginal MAP. NeurIPS 2023 - [c57]Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter:
Boosting AND/OR-based computational protein design: dynamic heuristics and generalizable UFO. UAI 2023: 1662-1672 - [i14]Daniel Karl I. Weidele, Shazia Afzal, Abel N. Valente, Cole Makuch, Owen Cornec, Long Vu, Dharmashankar Subramanian, Werner Geyer, Rahul Nair, Inge Vejsbjerg, Radu Marinescu, Paulito P. Palmes, Elizabeth M. Daly, Loraine Franke, Daniel Haehn:
AutoDOViz: Human-Centered Automation for Decision Optimization. CoRR abs/2302.09688 (2023) - [i13]Achille Fokoue, Ibrahim Abdelaziz, Maxwell Crouse, Shajith Ikbal, Akihiro Kishimoto, Guilherme Lima, Ndivhuwo Makondo, Radu Marinescu:
An Ensemble Approach for Automated Theorem Proving Based on Efficient Name Invariant Graph Neural Representations. CoRR abs/2305.08676 (2023) - [i12]Jasmina Gajcin, James McCarthy, Rahul Nair, Radu Marinescu, Elizabeth Daly, Ivana Dusparic:
Iterative Reward Shaping using Human Feedback for Correcting Reward Misspecification. CoRR abs/2308.15969 (2023) - [i11]Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter:
Boosting AND/OR-Based Computational Protein Design: Dynamic Heuristics and Generalizable UFO. CoRR abs/2309.00408 (2023) - 2022
- [c56]Akihiro Kishimoto, Djallel Bouneffouf, Radu Marinescu, Parikshit Ram, Ambrish Rawat, Martin Wistuba, Paulito P. Palmes, Adi Botea:
Bandit Limited Discrepancy Search and Application to Machine Learning Pipeline Optimization. AAAI 2022: 10228-10237 - [c55]Radu Marinescu, Haifeng Qian, Alexander G. Gray, Debarun Bhattacharjya, Francisco Barahona, Tian Gao, Ryan Riegel, Pravinda Sahu:
Logical Credal Networks. NeurIPS 2022 - [c54]Debarun Bhattacharjya, Radu Marinescu:
Hedging as Reward Augmentation in Probabilistic Graphical Models. NeurIPS 2022 - [c53]Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter:
AND/OR branch-and-bound for computational protein design optimizing K. UAI 2022: 1602-1612 - [i10]James McCarthy, Rahul Nair, Elizabeth Daly, Radu Marinescu, Ivana Dusparic:
Boolean Decision Rules for Reinforcement Learning Policy Summarisation. CoRR abs/2207.08651 (2022) - 2021
- [c52]Radu Marinescu, Akihiro Kishimoto, Parikshit Ram, Ambrish Rawat, Martin Wistuba, Paulito P. Palmes, Adi Botea:
Searching for Machine Learning Pipelines Using a Context-Free Grammar. AAAI 2021: 8902-8911 - [c51]Junkyu Lee, Radu Marinescu, Rina Dechter:
Submodel Decomposition Bounds for Influence Diagrams. AAAI 2021: 12147-12157 - [c50]Radu Marinescu, Junkyu Lee, Rina Dechter:
A New Bounding Scheme for Influence Diagrams. AAAI 2021: 12158-12165 - [c49]Segev Wasserkrug, Radu Marinescu, Sergey Zeltyn, Evgeny Shindin, Yishai A. Feldman:
Learning the Parameters of Bayesian Networks from Uncertain Data. AAAI 2021: 12190-12197 - [c48]Adi Botea, Massimiliano Mattetti, Akihiro Kishimoto, Radu Marinescu, Elizabeth Daly:
Counting Vertex-Disjoint Shortest Paths in Graphs. SOCS 2021: 28-36 - [i9]Paulito P. Palmes, Akihiro Kishimoto, Radu Marinescu, Parikshit Ram, Elizabeth Daly:
Designing Machine Learning Pipeline Toolkit for AutoML Surrogate Modeling Optimization. CoRR abs/2107.01253 (2021) - [i8]Haifeng Qian, Radu Marinescu, Alexander G. Gray, Debarun Bhattacharjya, Francisco Barahona, Tian Gao, Ryan Riegel, Pravinda Sahu:
Logical Credal Networks. CoRR abs/2109.12240 (2021) - [i7]Jasmina Gajcin, Rahul Nair, Tejaswini Pedapati, Radu Marinescu, Elizabeth Daly, Ivana Dusparic:
Contrastive Explanations for Comparing Preferences of Reinforcement Learning Agents. CoRR abs/2112.09462 (2021) - 2020
- [j9]Nic Wilson, Radu Marinescu:
An axiomatic framework for influence diagram computation with partially ordered preferences. Int. J. Approx. Reason. 125: 73-117 (2020) - [c47]Radu Marinescu, Akihiro Kishimoto, Adi Botea:
Parallel AND/OR Search for Marginal MAP. AAAI 2020: 10226-10234 - [c46]Adi Botea, Akihiro Kishimoto, Radu Marinescu, Elizabeth M. Daly, Oznur Alkan:
The Challenge of Optimal Paths in Graphs with Item Sets. ECAI 2020: 2885-2886 - [c45]Junkyu Lee, Radu Marinescu, Rina Dechter:
Heuristic AND/OR Search for Solving Influence Diagram. SOCS 2020: 127-128
2010 – 2019
- 2019
- [c44]Radu Marinescu, Akihiro Kishimoto, Adi Botea, Rina Dechter, Alexander Ihler:
Anytime Recursive Best-First Search for Bounding Marginal MAP. AAAI 2019: 7924-7932 - [c43]Akihiro Kishimoto, Adi Botea, Radu Marinescu:
Depth-First Memory-Limited AND/OR Search and Unsolvability in Cyclic Search Spaces. IJCAI 2019: 1280-1288 - [c42]Radu Marinescu, Rina Dechter:
Counting the Optimal Solutions in Graphical Models. NeurIPS 2019: 12091-12101 - [c41]Junkyu Lee, Radu Marinescu, Alexander Ihler, Rina Dechter:
A Weighted Mini-Bucket Bound for Solving Influence Diagram. UAI 2019: 1159-1168 - [i6]Adi Botea, Christian Muise, Shubham Agarwal, Oznur Alkan, Ondrej Bajgar, Elizabeth Daly, Akihiro Kishimoto, Luis A. Lastras, Radu Marinescu, Josef Ondrej, Pablo Pedemonte, Miroslav Vodolán:
Generating Dialogue Agents via Automated Planning. CoRR abs/1902.00771 (2019) - 2018
- [j8]Radu Marinescu, Junkyu Lee, Rina Dechter, Alexander Ihler:
AND/OR Search for Marginal MAP. J. Artif. Intell. Res. 63: 875-921 (2018) - [c40]Radu Marinescu, Rina Dechter, Alexander Ihler:
Stochastic Anytime Search for Bounding Marginal MAP. IJCAI 2018: 5074-5081 - [c39]Hao Cui, Radu Marinescu, Roni Khardon:
From Stochastic Planning to Marginal MAP. NeurIPS 2018: 3085-3095 - [c38]Adi Botea, Akihiro Kishimoto, Radu Marinescu:
On the Complexity of Quantum Circuit Compilation. SOCS 2018: 138-142 - 2017
- [j7]Natalia Flerova, Radu Marinescu, Rina Dechter:
Weighted heuristic anytime search: new schemes for optimization over graphical models. Ann. Math. Artif. Intell. 79(1-3): 77-128 (2017) - [c37]Radu Marinescu, Junkyu Lee, Alexander Ihler, Rina Dechter:
Anytime Best+Depth-First Search for Bounding Marginal MAP. AAAI 2017: 3775-3782 - [c36]Radu Marinescu, Abdul Razak, Nic Wilson:
Multi-Objective Influence Diagrams with Possibly Optimal Policies. AAAI 2017: 3783-3789 - [c35]Masataro Asai, Akihiro Kishimoto, Adi Botea, Radu Marinescu, Elizabeth M. Daly, Spyros Kotoulas:
Efficient Optimal Search under Expensive Edge Cost Computation. IJCAI 2017: 4266-4272 - 2016
- [j6]Natalia Flerova, Radu Marinescu, Rina Dechter:
Searching for the M Best Solutions in Graphical Models. J. Artif. Intell. Res. 55: 889-952 (2016) - [c34]Junkyu Lee, Radu Marinescu, Rina Dechter, Alexander Ihler:
From Exact to Anytime Solutions for Marginal MAP. AAAI 2016: 3255-3262 - [c33]Radu Marinescu, Akihiro Kishimoto, Adi Botea:
Scalable Exact MAP Inference in Graphical Models. ECAI 2016: 1684-1685 - [c32]Junkyu Lee, Radu Marinescu, Rina Dechter:
Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results. ISAIM 2016 - [c31]Spyros Kotoulas, Elizabeth Daly, Pierpaolo Tommasi, Akihiro Kishimoto, Vanessa López, Martin Stephenson, Adi Botea, Marco Luca Sbodio, Radu Marinescu, Ronan Rooney:
Service Bundle Recommendation for Person-Centered Care Planning in Cities. MIE 2016: 33-37 - 2015
- [c30]Radu Marinescu, Rina Dechter, Alexander Ihler:
Pushing Forward Marginal MAP with Best-First Search. IJCAI 2015: 696-702 - [c29]Nic Wilson, Abdul Razak, Radu Marinescu:
Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs. IJCAI 2015: 815-822 - [c28]Akihiro Kishimoto, Radu Marinescu, Adi Botea:
Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models. NIPS 2015: 928-936 - 2014
- [j5]Ban Kawas, Ali Koc, Marco Laumanns, Chungmok Lee, Radu Marinescu, Martin Mevissen, Nicole Taheri, Susara Van den Heever, Rudi Verago:
Unified framework and toolkit for commerce optimization under uncertainty. IBM J. Res. Dev. 58(5/6) (2014) - [c27]Junkyu Lee, Radu Marinescu, Rina Dechter:
Applying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results. StarAI@AAAI 2014 - [c26]Natalia Flerova, Radu Marinescu, Rina Dechter:
Weighted Best First Search for Graphical Models. ISAIM 2014 - [c25]Elizabeth M. Daly, Adi Botea, Akihiro Kishimoto, Radu Marinescu:
Multi-criteria journey aware housing recommender system. RecSys 2014: 325-328 - [c24]Natalia Flerova, Radu Marinescu, Rina Dechter:
Evaluating Weighted DFS Branch and Bound over Graphical Models. SOCS 2014: 71-79 - [c23]Akihiro Kishimoto, Radu Marinescu:
Recursive Best-First AND/OR Search for Optimization in Graphical Models. UAI 2014: 400-409 - [c22]Radu Marinescu, Rina Dechter, Alexander Ihler:
AND/OR Search for Marginal MAP. UAI 2014: 563-572 - [i5]Robert Mateescu, Rina Dechter, Radu Marinescu:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. CoRR abs/1401.3448 (2014) - 2013
- [c21]Radu Marinescu, Abdul Razak, Nic Wilson:
Multi-Objective Constraint Optimization with Tradeoffs. CP 2013: 497-512 - 2012
- [c20]Rina Dechter, Natalia Flerova, Radu Marinescu:
Search Algorithms for m Best Solutions for Graphical Models. AAAI 2012: 1895-1901 - [c19]Nic Wilson, Radu Marinescu:
An Axiomatic Framework for Influence Diagram Computation with Partially Ordered Utilities. KR 2012 - [c18]Radu Marinescu, Abdul Razak, Nic Wilson:
Multi-objective Influence Diagrams. UAI 2012: 574-583 - [i4]Radu Marinescu, Nic Wilson:
Order-of-Magnitude Influence Diagrams. CoRR abs/1202.3745 (2012) - [i3]Radu Marinescu, Rina Dechter:
Best-First AND/OR Search for Most Probable Explanations. CoRR abs/1206.5268 (2012) - [i2]Radu Marinescu, Abdul Razak, Nic Wilson:
Multi-objective Influence Diagrams. CoRR abs/1210.4911 (2012) - [i1]Radu Marinescu, Kalev Kask, Rina Dechter:
Systematic vs. Non-systematic Algorithms for Solving the MPE Task. CoRR abs/1212.2505 (2012) - 2011
- [c17]Radu Marinescu:
Efficient Approximation Algorithms for Multi-objective Constraint Optimization. ADT 2011: 150-164 - [c16]Radu Marinescu, Nic Wilson:
Order-of-Magnitude Influence Diagrams. UAI 2011: 489-496 - 2010
- [j4]Radu Marinescu, Rina Dechter:
Evaluating the impact of AND/OR search on 0-1 integer linear programming. Constraints An Int. J. 15(1): 29-63 (2010) - [c15]Radu Marinescu:
Best-First vs. Depth-First AND/OR Search for Multi-objective Constraint Optimization. ICTAI (1) 2010: 439-446
2000 – 2009
- 2009
- [j3]Radu Marinescu, Rina Dechter:
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models. Artif. Intell. 173(16-17): 1457-1491 (2009) - [j2]Radu Marinescu, Rina Dechter:
Memory intensive AND/OR search for combinatorial optimization in graphical models. Artif. Intell. 173(16-17): 1492-1524 (2009) - [c14]Radu Marinescu:
Exploiting Problem Decomposition in Multi-objective Constraint Optimization. CP 2009: 592-607 - [c13]Ioannis M. Dokas, Richard J. Wallace, Radu Marinescu, Syed Imran, Franclin S. Foping:
Towards a novel early warning service for state agencies: A feasibility study. ITEE 2009: 162-175 - [c12]Radu Marinescu:
A New Approach to Influence Diagrams Evaluation. SGAI Conf. 2009: 107-120 - 2008
- [j1]Robert Mateescu, Rina Dechter, Radu Marinescu:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. J. Artif. Intell. Res. 33: 465-519 (2008) - [c11]Rina Dechter, Lars Otten, Radu Marinescu:
On the Practical Significance of Hypertree vs. TreeWidth. ECAI 2008: 913-914 - 2007
- [c10]Radu Marinescu, Rina Dechter:
Best-First AND/OR Search for Graphical Models. AAAI 2007: 1171-1176 - [c9]Robert Mateescu, Radu Marinescu, Rina Dechter:
AND/OR Multi-valued Decision Diagrams for Constraint Optimization. CP 2007: 498-513 - [c8]Radu Marinescu, Rina Dechter:
Best-First AND/OR Search for 0/1 Integer Programming. CPAIOR 2007: 171-185 - [c7]Radu Marinescu, Rina Dechter:
Best-First AND/OR Search for Most Probable Explanations. UAI 2007: 259-266 - 2006
- [c6]Radu Marinescu, Rina Dechter:
Memory Intensive Branch-and-Bound Search for Graphical Models. AAAI 2006: 1200-1205 - [c5]Radu Marinescu, Rina Dechter:
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems. CPAIOR 2006: 152-166 - [c4]Radu Marinescu, Rina Dechter:
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models. ECAI 2006: 138-142 - 2005
- [c3]Radu Marinescu, Rina Dechter:
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems. CP 2005: 857 - [c2]Radu Marinescu, Rina Dechter:
AND/OR Branch-and-Bound for Graphical Models. IJCAI 2005: 224-229 - 2003
- [c1]Radu Marinescu, Kalev Kask, Rina Dechter:
Systematic vs. Non-systematic Algorithms for Solving the MPE Task. UAI 2003: 394-402
Coauthor Index
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 2024-08-05 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
