Radu Marinescu

Publications58
h-index15
Citations754
Highly Influential Citations58
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • R. Dechter
  • 329 Publications, 16,384 Citations
  • A. Ihler
  • 129 Publications, 4,632 Citations
  • N. Wilson
  • 138 Publications, 1,742 Citations
  • Junkyu Lee
  • 20 Publications, 63 Citations
  • Publications
  • Influence
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models
TLDR
We introduce a new generation of depth-first Branch-and-Bound algorithms that explore the AND/OR search tree using static and dynamic variable orderings. Expand
  • 100
  • 10
  • PDF
AND/OR Branch-and-Bound for Graphical Models
TLDR
A new generation of depth-first Branch-and-Bound algorithms that explore an AND/OR search space and use static and dynamic mini-bucket heuristics to guide the search. Expand
  • 84
  • 10
  • PDF
Memory intensive AND/OR search for combinatorial optimization in graphical models
TLDR
We extend the depth-first AND/OR Branch-and-Bound tree search algorithm to explore an AND/ OR search graph by equipping it with an adaptive caching scheme similar to good and no-good recording. Expand
  • 57
  • 5
  • PDF
On the Complexity of Quantum Circuit Compilation
TLDR
We formulate a makespan optimization problem based on QCC, and prove that the problem is NP-complete. Expand
  • 32
  • 5
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models
TLDR
We present the AND/OR Multi-Valued Decision Diagram (AOMDD) which compiles a graphical model into a canonical form that supports polynomial (e.g., solution counting, belief updating) queries. Expand
  • 44
  • 4
  • PDF
Memory Intensive Branch-and-Bound Search for Graphical Models
TLDR
We extend the AOBB algorithm to explore an AND/OR search graph by equipping it with a context-based adaptive caching scheme similar to good and no-good recording. Expand
  • 21
  • 4
  • PDF
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
TLDR
We introduce in this paper a new dynamic AND/OR Branch-and-Bound algorithmic framework which accommodates variable ordering heuristics. Expand
  • 20
  • 3
  • PDF
Anytime Best+Depth-First Search for Bounding Marginal MAP
TLDR
We introduce new anytime search algorithms that combine best-first with depth-first search into hybrid schemes for Marginal MAP inference in graphical models. Expand
  • 13
  • 3
  • PDF
Search Algorithms for m Best Solutions for Graphical Models
TLDR
The paper focuses on finding the m best solutions to combinatorial optimization problems using Best-First or Branch-and-Bound search. Expand
  • 32
  • 2
  • PDF
Best-First AND/OR Search for Graphical Models
TLDR
We present a new AND/OR search algorithm that explores a context-minimal AND/ OR search graph in a best-first rather than depth first manner. Expand
  • 33
  • 2
  • PDF