Margarita P. Castro

Orcid: 0000-0002-4689-6143

According to our database1, Margarita P. Castro authored at least 15 papers between 2018 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Learning reward machines: A study in partially observable reinforcement learning.
Artif. Intell., October, 2023

Optimization methods based on decision diagrams for constraint programming, AI planning, and mathematical programming.
Constraints An Int. J., September, 2023

2022
A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming.
Math. Program., 2022

The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions.
J. Artif. Intell. Res., 2022

Decision Diagrams for Discrete Optimization: A Survey of Recent Advances.
INFORMS J. Comput., 2022

2021
LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020
Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics.
J. Artif. Intell. Res., 2020

An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP.
INFORMS J. Comput., 2020

Empirical Confidence Models for Supervised Machine Learning.
Proceedings of the Advances in Artificial Intelligence, 2020

2019
Learning Reward Machines for Partially Observable Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Training Binarized Neural Networks Using MIP and CP.
Proceedings of the Principles and Practice of Constraint Programming, 2019

Relaxed BDDs: An Admissible Heuristic for Delete-Free Planning Based on a Discrete Relaxation.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018
Intruder alert! Optimization models for solving the mobile robot graph-clear problem.
Constraints An Int. J., 2018

Compiling Optimal Numeric Planning to Mixed Integer Linear Programming.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Linear and Integer Programming-Based Heuristics for Cost-Optimal Numeric Planning.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018


  Loading...