default search action
Margarita P. Castro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j8]Rodrigo Toro Icarte
, Toryn Q. Klassen, Richard Valenzano, Margarita P. Castro
Learning reward machines: A study in partially observable reinforcement learning. Artif. Intell. 323: 103989 (2023) - [j7]Margarita P. Castro
Optimization methods based on decision diagrams for constraint programming, AI planning, and mathematical programming. Constraints An Int. J. 28(3): 511-512 (2023) - 2022
- [j6]Margarita P. Castro
Decision Diagrams for Discrete Optimization: A Survey of Recent Advances. INFORMS J. Comput. 34(4): 2271-2295 (2022) - [j5]Ryo Kuroiwa
The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions. J. Artif. Intell. Res. 75: 1477-1548 (2022) - [j4]Margarita P. Castro
A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming. Math. Program. 196(1): 115-171 (2022) - 2021
- [c7]Ryo Kuroiwa, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro, J. Christopher Beck:
LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions. ICAPS 2021: 210-218 - [i1]Rodrigo Toro Icarte, Ethan Waldie, Toryn Q. Klassen, Richard Anthony Valenzano, Margarita P. Castro, Sheila A. McIlraith:
Learning Reward Machines: A Study in Partially Observable Reinforcement Learning. CoRR abs/2112.09477 (2021) - 2020
- [j3]Margarita P. Castro
An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP. INFORMS J. Comput. 32(2): 263-278 (2020) - [j2]Margarita P. Castro
Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics. J. Artif. Intell. Res. 67: 607-651 (2020) - [c6]Margarita P. Castro
Empirical Confidence Models for Supervised Machine Learning. Canadian AI 2020: 105-117
2010 – 2019
- 2019
- [c5]Margarita P. Castro, Chiara Piacentini, André A. Ciré, J. Christopher Beck:
Relaxed BDDs: An Admissible Heuristic for Delete-Free Planning Based on a Discrete Relaxation. ICAPS 2019: 77-85 - [c4]Rodrigo Toro Icarte, León Illanes, Margarita P. Castro
Training Binarized Neural Networks Using MIP and CP. CP 2019: 401-417 - [c3]Rodrigo Toro Icarte, Ethan Waldie, Toryn Q. Klassen, Richard Anthony Valenzano, Margarita P. Castro, Sheila A. McIlraith:
Learning Reward Machines for Partially Observable Reinforcement Learning. NeurIPS 2019: 15497-15508 - 2018
- [j1]Michael Morin
Intruder alert! Optimization models for solving the mobile robot graph-clear problem. Constraints An Int. J. 23(3): 335-354 (2018) - [c2]Chiara Piacentini, Margarita P. Castro, André Augusto Ciré, J. Christopher Beck:
Linear and Integer Programming-Based Heuristics for Cost-Optimal Numeric Planning. AAAI 2018: 6254-6261 - [c1]Chiara Piacentini, Margarita P. Castro, André Augusto Ciré, J. Christopher Beck:
Compiling Optimal Numeric Planning to Mixed Integer Linear Programming. ICAPS 2018: 383-387
Coauthor Index
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.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: