![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Radu Marinescu 0001
University of Timisoara, Romania - Radu Marinescu 0002
IBM Research, Dublin, Ireland
Likely matches
- Radu-Sebastian Marinescu
Rohde & Schwarz Topex, Bucharest, Romania - Radu-Florin Marinescu
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 135 matches
- 2024
- 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) - 2023
- Andy Molin
, Andrei Mario Rivis, Radu Marinescu:
Assessing the Real Impact of Open-Source Components in Software Systems. IEEE Access 11: 111226-111237 (2023) - Ionut-Petrisor Anghel, Dragos Radulescu, Ion Alexandru Marinescu:
Effective solutions to prevent digital fraud by introducing electronic signature of PDF files. CSCS 2023: 186-191 - 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 - 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 - 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 - 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 - Radu Marinescu, Debarun Bhattacharjya, Junkyu Lee, Fabio Cozman, Alexander G. Gray:
Credal Marginal MAP. NeurIPS 2023 - Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter:
Boosting AND/OR-based computational protein design: dynamic heuristics and generalizable UFO. UAI 2023: 1662-1672 - 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) - 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) - 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) - 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
- 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 - Radu Marinescu, Haifeng Qian, Alexander G. Gray, Debarun Bhattacharjya, Francisco Barahona, Tian Gao, Ryan Riegel, Pravinda Sahu:
Logical Credal Networks. NeurIPS 2022 - Debarun Bhattacharjya, Radu Marinescu:
Hedging as Reward Augmentation in Probabilistic Graphical Models. NeurIPS 2022 - Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter:
AND/OR branch-and-bound for computational protein design optimizing K. UAI 2022: 1602-1612 - James McCarthy, Rahul Nair, Elizabeth Daly, Radu Marinescu, Ivana Dusparic:
Boolean Decision Rules for Reinforcement Learning Policy Summarisation. CoRR abs/2207.08651 (2022) - 2021
- Junkyu Lee, Radu Marinescu, Rina Dechter:
Submodel Decomposition Bounds for Influence Diagrams. AAAI 2021: 12147-12157 - Radu Marinescu, Junkyu Lee, Rina Dechter:
A New Bounding Scheme for Influence Diagrams. AAAI 2021: 12158-12165 - 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 - Segev Wasserkrug, Radu Marinescu, Sergey Zeltyn, Evgeny Shindin, Yishai A. Feldman:
Learning the Parameters of Bayesian Networks from Uncertain Data. AAAI 2021: 12190-12197 - Adi Botea, Massimiliano Mattetti, Akihiro Kishimoto, Radu Marinescu, Elizabeth Daly:
Counting Vertex-Disjoint Shortest Paths in Graphs. SOCS 2021: 28-36 - 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) - 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) - 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
- Nic Wilson
, Radu Marinescu:
An axiomatic framework for influence diagram computation with partially ordered preferences. Int. J. Approx. Reason. 125: 73-117 (2020) - Radu Marinescu, Akihiro Kishimoto, Adi Botea:
Parallel AND/OR Search for Marginal MAP. AAAI 2020: 10226-10234 - 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 - Junkyu Lee, Radu Marinescu, Rina Dechter:
Heuristic AND/OR Search for Solving Influence Diagram. SOCS 2020: 127-128
skipping 105 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-06-17 17:01 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint