Source: Proceedings. Conference titles: International Conference on Automated Planning and Scheduling - ICAPS 2016. Unidade: ICMC
Subjects: SISTEMAS EMBUTIDOS, COMPUTAÇÃO EVOLUTIVA, ROBÓTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SANTANA, Pedro et al. PARIS: a polynomial-time, risk-sensitive scheduling algorithm for probabilistic simple temporal networks with uncertainty. 2016, Anais.. Palo Alto, California, USA: Association for the Advancement of Artificial Intelligence, 2016. Disponível em: http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13138. Acesso em: 08 jun. 2024.APA
Santana, P., Vaquero, T., Toledo, C. F. M., Wang, A., Fang, C., & Williams, B. (2016). PARIS: a polynomial-time, risk-sensitive scheduling algorithm for probabilistic simple temporal networks with uncertainty. In Proceedings. Palo Alto, California, USA: Association for the Advancement of Artificial Intelligence. Recuperado de http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13138NLM
Santana P, Vaquero T, Toledo CFM, Wang A, Fang C, Williams B. PARIS: a polynomial-time, risk-sensitive scheduling algorithm for probabilistic simple temporal networks with uncertainty [Internet]. Proceedings. 2016 ;[citado 2024 jun. 08 ] Available from: http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13138Vancouver
Santana P, Vaquero T, Toledo CFM, Wang A, Fang C, Williams B. PARIS: a polynomial-time, risk-sensitive scheduling algorithm for probabilistic simple temporal networks with uncertainty [Internet]. Proceedings. 2016 ;[citado 2024 jun. 08 ] Available from: http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13138
