Radu Marinescu

发表

The Challenge of Optimal Paths in Graphs with Item Sets

Akihiro Kishimoto, Adi Botea, Oznur Alkan, 2020, ECAI.

Applying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results

Rina Dechter, Radu Marinescu, Junkyu Lee, 2014, AAAI Workshop: Statistical Relational Artificial Intelligence.

Service Bundle Recommendation for Person-Centered Care Planning in Cities

Akihiro Kishimoto, Vanessa López, Spyros Kotoulas, 2016, MIE.

Towards a novel early warning service for state agencies: A feasibility study

Richard J. Wallace, Ioannis M. Dokas, Radu Marinescu, 2009, ITEE.

AND/OR Branch-and-Bound for Graphical Models

Rina Dechter, Radu Marinescu, R. Dechter, 2005, IJCAI.

From Stochastic Planning to Marginal MAP

Roni Khardon, Hao Cui, Radu Marinescu, 2018, NeurIPS.

AND/OR Branch-and-Bound search for combinatorial optimization in graphical models

Rina Dechter, Radu Marinescu, R. Dechter, 2009, Artif. Intell..

Weighted heuristic anytime search: new schemes for optimization over graphical models

Rina Dechter, Radu Marinescu, Natalia Flerova, 2015, Annals of Mathematics and Artificial Intelligence.

Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models

Rina Dechter, Radu Marinescu, 2006, ECAI.

Best-First AND/OR Search for Most Probable Explanations

Rina Dechter, Radu Marinescu, 2007, UAI.

Depth-First Memory-Limited AND/OR Search and Unsolvability in Cyclic Search Spaces

Akihiro Kishimoto, Adi Botea, Radu Marinescu, 2019, IJCAI.

On the Complexity of Quantum Circuit Compilation

Akihiro Kishimoto, Adi Botea, Radu Marinescu, 2018, SOCS.

On the Practical Significance of Hypertree vs. TreeWidth

Lars Otten, Rina Dechter, Radu Marinescu, 2008, ECAI.

AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems

Rina Dechter, Radu Marinescu, 2006, CPAIOR.

AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems

Rina Dechter, Radu Marinescu, 2005, CP.

From Exact to Anytime Solutions for Marginal MAP

Rina Dechter, Alexander T. Ihler, Radu Marinescu, 2016, AAAI.

Counting the Optimal Solutions in Graphical Models

Rina Dechter, Radu Marinescu, 2019, NeurIPS.

Heuristic AND/OR Search for Solving Influence Diagram

Rina Dechter, Radu Marinescu, Junkyu Lee, 2020, SOCS.

Efficient Approximation Algorithms for Multi-objective Constraint Optimization

Radu Marinescu, 2011, ADT.

A New Approach to Influence Diagrams Evaluation

Radu Marinescu, 2009, SGAI Conf..

Multi-Objective Influence Diagrams with Possibly Optimal Policies

Nic Wilson, Radu Marinescu, Abdul Razak, 2017, AAAI.

Pushing Forward Marginal MAP with Best-First Search

Rina Dechter, Alexander T. Ihler, Radu Marinescu, 2015, IJCAI.

Parallel AND/OR Search for Marginal MAP

Akihiro Kishimoto, Adi Botea, Radu Marinescu, 2020, AAAI.

Stochastic Anytime Search for Bounding Marginal MAP

Rina Dechter, Alexander T. Ihler, Radu Marinescu, 2018, IJCAI.

Best-First AND/OR Search for 0/1 Integer Programming

Rina Dechter, Radu Marinescu, 2007, CPAIOR.

AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models

Rina Dechter, Robert Mateescu, Radu Marinescu, 2008, J. Artif. Intell. Res..

Order-of-Magnitude Influence Diagrams

Nic Wilson, Radu Marinescu, Radu Marinescu, 2011, UAI.

Recursive Best-First AND/OR Search for Optimization in Graphical Models

Akihiro Kishimoto, Radu Marinescu, 2014, UAI.

Evaluating the impact of AND/OR search on 0-1 integer linear programming

Rina Dechter, Radu Marinescu, R. Dechter, 2009, Constraints.

Memory Intensive Branch-and-Bound Search for Graphical Models

Rina Dechter, Radu Marinescu, 2006, AAAI.

Systematic vs. Non-systematic Algorithms for Solving the MPE Task pdf

Rina Dechter, Radu Marinescu, Kalev Kask, 2003, UAI.

A Weighted Mini-Bucket Bound for Solving Influence Diagram

Rina Dechter, Alexander T. Ihler, Radu Marinescu, 2019, UAI.

Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs

Nic Wilson, Radu Marinescu, Abdul Razak, 2015, IJCAI.

Anytime Recursive Best-First Search for Bounding Marginal MAP

Akihiro Kishimoto, Adi Botea, Rina Dechter, 2019, AAAI.

Multi-Objective Constraint Optimization with Tradeoffs

Nic Wilson, Radu Marinescu, Abdul Razak, 2013, CP.

Efficient Optimal Search under Expensive Edge Cost Computation

Akihiro Kishimoto, Spyros Kotoulas, Adi Botea, 2017, IJCAI.

AND/OR Search for Marginal MAP

Rina Dechter, Alexander T. Ihler, Radu Marinescu, 2014, UAI.

An axiomatic framework for influence diagram computation with partially ordered preferences

Nic Wilson, Radu Marinescu, 2020, Int. J. Approx. Reason..

AND/OR Multi-valued Decision Diagrams for Constraint Optimization

Rina Dechter, Robert Mateescu, Radu Marinescu, 2007, CP.

Exploiting Problem Decomposition in Multi-objective Constraint Optimization

Radu Marinescu, Radu Marinescu, 2009, CP.

Anytime AND/OR Best-First Search for Optimization in Graphical Models

Rina Dechter, Radu Marinescu, Natalia Flerova, 2013 .

Multi-objective Influence Diagrams

Nic Wilson, Radu Marinescu, Abdul Razak, 2012, UAI.

Best-First AND/OR Search for Graphical Models

Rina Dechter, Radu Marinescu, 2007, AAAI.

Best-First vs. Depth-First AND/OR Search for Multi-objective Constraint Optimization

Radu Marinescu, 2010, 2010 22nd IEEE International Conference on Tools with Artificial Intelligence.

Evaluating Weighted DFS Branch and Bound over Graphical Models

Rina Dechter, Radu Marinescu, Natalia Flerova, 2014, SOCS.

An Axiomatic Framework for Influence Diagram Computation with Partially Ordered Utilities

Nic Wilson, Radu Marinescu, 2012, KR.

Parallel Recursive Best-First AND/OR Search for Exact MAP Inference in Graphical Models

Akihiro Kishimoto, Adi Botea, Radu Marinescu, 2015, NIPS.

Scalable Exact MAP Inference in Graphical Models

Akihiro Kishimoto, Adi Botea, Radu Marinescu, 2016, ECAI.

Searching for the M Best Solutions in Graphical Models

Rina Dechter, Radu Marinescu, Natalia Flerova, 2016, J. Artif. Intell. Res..

Generating Dialogue Agents via Automated Planning pdf

Akihiro Kishimoto, Miroslav Vodolán, Adi Botea, 2019, ArXiv.

Search Algorithms for m Best Solutions for Graphical Models

Rina Dechter, Radu Marinescu, Natalia Flerova, 2012, AAAI.

Weighted Best First Search for Graphical Models

Rina Dechter, Radu Marinescu, Natalia Flerova, 2014, ISAIM.

Multi-criteria journey aware housing recommender system

Akihiro Kishimoto, Adi Botea, Elizabeth M. Daly, 2014, RecSys '14.

Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results

Rina Dechter, Radu Marinescu, Junkyu Lee, 2016, ISAIM.

Anytime Best+Depth-First Search for Bounding Marginal MAP

Rina Dechter, Alexander T. Ihler, Radu Marinescu, 2017, AAAI.

Unified framework and toolkit for commerce optimization under uncertainty

Marco Laumanns, Rudi Verago, Radu Marinescu, 2014, IBM J. Res. Dev..

Memory intensive AND/OR search for combinatorial optimization in graphical models

Rina Dechter, Radu Marinescu, 2009, Artif. Intell..

Counting Vertex-Disjoint Shortest Paths in Graphs

Akihiro Kishimoto, Adi Botea, Radu Marinescu, 2021, SOCS.

Logical Credal Networks pdf

Alexander G. Gray, Radu Marinescu, Francisco Barahona, 2021, NeurIPS.

Searching for Machine Learning Pipelines Using a Context-Free Grammar

Parikshit Ram, Akihiro Kishimoto, Adi Botea, 2021, AAAI.

A New Bounding Scheme for Influence Diagrams

Rina Dechter, Radu Marinescu, Junkyu Lee, 2021, AAAI.

Designing Machine Learning Pipeline Toolkit for AutoML Surrogate Modeling Optimization pdf

Parikshit Ram, Akihiro Kishimoto, Radu Marinescu, 2021, JuliaCon Proceedings.

Submodel Decomposition Bounds for Influence Diagrams

Rina Dechter, Radu Marinescu, Junkyu Lee, 2021, AAAI.

Contrastive Explanations for Comparing Preferences of Reinforcement Learning Agents pdf

Ivana Dusparic, Radu Marinescu, Tejaswini Pedapati, 2021, ArXiv.

Advances in AND / OR Branch-and-Bound Search for Constraint Optimization

Rina Dechter, Radu Marinescu, R. Dechter, 2005 .

Towards a Repository of Common Programming Technologies Knowledge

Radu Marinescu, Martin Feilkas, Daniel Ratiu, 2008 .

Preliminary Empirical Evaluation of Anytime Weighted AND / OR Best-First Search for MAP

Radu Marinescu, Natalia Flerova, 2012 .

And/or search strategies for combinatorial optimization in graphical models

Rina Dechter, Radu Marinescu, R. Dechter, 2008 .