Radu Marinescu

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Generating Dialogue Agents via Automated Planning.

[BibT_eX]

[DOI]

CoRR, 2019

A Weighted Mini-Bucket Bound for Solving Influence Diagram.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

Counting the Optimal Solutions in Graphical Models.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

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

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Anytime Recursive Best-First Search for Bounding Marginal MAP.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

AND/OR Search for Marginal MAP.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2018

On the Complexity of Quantum Circuit Compilation.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

From Stochastic Planning to Marginal MAP.

[BibT_eX]

[DOI]

Hao Cui

Roni Khardon

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Stochastic Anytime Search for Bounding Marginal MAP.

[BibT_eX]

[DOI]

Alexander Ihler

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

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

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2017

Efficient Optimal Search under Expensive Edge Cost Computation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Multi-Objective Influence Diagrams with Possibly Optimal Policies.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Anytime Best+Depth-First Search for Bounding Marginal MAP.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Searching for the M Best Solutions in Graphical Models.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2016

Service Bundle Recommendation for Person-Centered Care Planning in Cities.

[BibT_eX]

[DOI]

Proceedings of the Exploring Complexity in Health: An Interdisciplinary Systems Approach - Proceedings of MIE2016 at HEC2016, Munich, Germany, 28 August, 2016

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

[BibT_eX]

[DOI]

Junkyu Lee

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

Scalable Exact MAP Inference in Graphical Models.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

From Exact to Anytime Solutions for Marginal MAP.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

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

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Pushing Forward Marginal MAP with Best-First Search.

[BibT_eX]

[DOI]

Alexander Ihler

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

Unified framework and toolkit for commerce optimization under uncertainty.

[BibT_eX]

[DOI]

Susara Van den Heever

Rudi Verago

IBM J. Res. Dev., 2014

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

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, 2014

AND/OR Search for Marginal MAP.

[BibT_eX]

[DOI]

Alexander Ihler

Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, 2014

Evaluating Weighted DFS Branch and Bound over Graphical Models.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Multi-criteria journey aware housing recommender system.

[BibT_eX]

[DOI]

Proceedings of the Eighth ACM Conference on Recommender Systems, 2014

Weighted Best First Search for Graphical Models.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Applying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results.

[BibT_eX]

[DOI]

Junkyu Lee

Proceedings of the Statistical Relational Artificial Intelligence, 2014

2013

Multi-Objective Constraint Optimization with Tradeoffs.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2013

2012

Multi-objective Influence Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

An Axiomatic Framework for Influence Diagram Computation with Partially Ordered Utilities.

[BibT_eX]

[DOI]

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Search Algorithms for m Best Solutions for Graphical Models.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Order-of-Magnitude Influence Diagrams.

[BibT_eX]

[DOI]

Proceedings of the UAI 2011, 2011

Efficient Approximation Algorithms for Multi-objective Constraint Optimization.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - Second International Conference, 2011

2010

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

[BibT_eX]

[DOI]

Constraints An Int. J., 2010

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

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010

2009

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

[BibT_eX]

[DOI]

Artif. Intell., 2009

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

[BibT_eX]

[DOI]

Artif. Intell., 2009

A New Approach to Influence Diagrams Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Research and Development in Intelligent Systems XXVI, 2009

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

[BibT_eX]

[DOI]

Proceedings of the Information Technologies in Environmental Engineering, 2009

Exploiting Problem Decomposition in Multi-objective Constraint Optimization.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2009

2008

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

[BibT_eX]

[DOI]

Robert Mateescu

J. Artif. Intell. Res., 2008

On the Practical Significance of Hypertree vs. TreeWidth.

[BibT_eX]

[DOI]

Lars Otten

Proceedings of the ECAI 2008, 2008

2007

Best-First AND/OR Search for Most Probable Explanations.

[BibT_eX]

[DOI]

Proceedings of the UAI 2007, 2007

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

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

AND/OR Multi-valued Decision Diagrams for Constraint Optimization.

[BibT_eX]

[DOI]

Robert Mateescu

Proceedings of the Principles and Practice of Constraint Programming, 2007

Best-First AND/OR Search for Graphical Models.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

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

[BibT_eX]

[DOI]

Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

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

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2006

Memory Intensive Branch-and-Bound Search for Graphical Models.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

2005

AND/OR Branch-and-Bound for Graphical Models.

[BibT_eX]

[DOI]

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

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

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2005

2003

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

[BibT_eX]

[DOI]