PARIS: A Polynomial-Time, Risk-Sensitive Scheduling Algorithm for Probabilistic Simple Temporal Networks with Uncertainty. de Rodrigues Quemel e Assis Santana, P. H., Vaquero, T., Toledo, C., Wang, A. J., Fang, C., & Williams, B. C. In Coles, A. J., Coles, A., Edelkamp, S., Magazzeni, D., & Sanner, S., editors, Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, ICAPS 2016, London, UK, June 12-17, 2016, pages 267–275, 2016. AAAI Press.
PARIS: A Polynomial-Time, Risk-Sensitive Scheduling Algorithm for Probabilistic Simple Temporal Networks with Uncertainty [link]Paper  bibtex   
@inproceedings{DBLP:conf/aips/SantanaVTWFW16,
  author       = {Pedro Henrique de Rodrigues Quemel e Assis Santana and
                  Tiago Vaquero and
                  Cl{\'{a}}udio Toledo and
                  Andrew J. Wang and
                  Cheng Fang and
                  Brian Charles Williams},
  editor       = {Amanda Jane Coles and
                  Andrew Coles and
                  Stefan Edelkamp and
                  Daniele Magazzeni and
                  Scott Sanner},
  title        = {{PARIS:} {A} Polynomial-Time, Risk-Sensitive Scheduling Algorithm
                  for Probabilistic Simple Temporal Networks with Uncertainty},
  booktitle    = {Proceedings of the Twenty-Sixth International Conference on Automated
                  Planning and Scheduling, {ICAPS} 2016, London, UK, June 12-17, 2016},
  pages        = {267--275},
  publisher    = {{AAAI} Press},
  year         = {2016},
  url          = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13138},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/aips/SantanaVTWFW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0