Parisa Zehtabi

Orcid: 0000-0003-1146-046X

According to our database1, Parisa Zehtabi authored at least 15 papers between 2019 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Capacity planning and scheduling for jobs with uncertainty in resource usage and duration.
J. Supercomput., October, 2024

Rating Multi-Modal Time-Series Forecasting Models (MM-TSFM) for Robustness Through a Causal Lens.
CoRR, 2024

Deep Reinforcement Learning and Mean-Variance Strategies for Responsible Portfolio Optimization.
CoRR, 2024

Surrogate Assisted Monte Carlo Tree Search in Combinatorial Optimization.
CoRR, 2024

Contrastive Explanations of Centralized Multi-agent Optimization Solutions.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

Temporal Fairness in Decision Making Problems.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Contrastive Explanations of Multi-agent Optimization Solutions.
CoRR, 2023

Towards Accelerating Benders Decomposition via Reinforcement Learning Surrogate Models.
CoRR, 2023

2022
Explaining Preference-Driven Schedules: The EXPRES Framework.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Optimal Admission Control for Multiclass Queues with Time-Varying Arrival Rates via State Abstraction.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Efficient Anytime Computation and Execution of Decoupled Robustness Envelopes for Temporal Plans.
Proceedings of the 28th International Symposium on Temporal Representation and Reasoning, 2021

2020
Planning for Hybrid Systems via Satisfiability Modulo Theories.
J. Artif. Intell. Res., 2020

2019
Towards Efficient Anytime Computation and Execution of Decoupled Robustness Envelopes for Temporal Plans.
CoRR, 2019

Robustness Envelopes for Temporal Plans.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019


  Loading...