PARIS: A Polynomial-Time, Risk-Sensitive Scheduling Algorithm for Probabilistic Simple Temporal Networks with Uncertainty

Research article (Proceedings of the International Conference on Automated Planning and Scheduling, 2016) · cited 19× · AI/ML
Press Enter · cited answer in seconds

PARIS: A Polynomial-Time, Risk-Sensitive Scheduling Algorithm for Probabilistic Simple Temporal Networks with Uncertainty

Summary

PARIS: A Polynomial-Time, Risk-Sensitive Scheduling Algorithm for Probabilistic Simple Temporal Networks with Uncertainty is a scholarly article[1].

Key Facts

  • PARIS: A Polynomial-Time, Risk-Sensitive Scheduling Algorithm for Probabilistic Simple Temporal Networks with Uncertainty's instance of is recorded as scholarly article[2].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). PARIS: A Polynomial-Time, Risk-Sensitive Scheduling Algorithm for Probabilistic Simple Temporal Networks with Uncertainty. Retrieved May 24, 2026, from https://4ort.xyz/entity/paris-a-polynomial-time-risk-sensitive-scheduling-algorithm-for-probabilistic-simple-temporal-networks-with-uncertainty
MLA “PARIS: A Polynomial-Time, Risk-Sensitive Scheduling Algorithm for Probabilistic Simple Temporal Networks with Uncertainty.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/paris-a-polynomial-time-risk-sensitive-scheduling-algorithm-for-probabilistic-simple-temporal-networks-with-uncertainty.
BibTeX @misc{4ortxyz_paris-a-polynomial-time-risk-sensitive-scheduling-algorithm-for-probabilistic-simple-temporal-networks-with-uncertainty_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{PARIS: A Polynomial-Time, Risk-Sensitive Scheduling Algorithm for Probabilistic Simple Temporal Networks with Uncertainty}}, year = {2026}, url = {https://4ort.xyz/entity/paris-a-polynomial-time-risk-sensitive-scheduling-algorithm-for-probabilistic-simple-temporal-networks-with-uncertainty}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): PARIS: A Polynomial-Time, Risk-Sensitive Scheduling Algorithm for Probabilistic Simple Temporal Networks with Uncertainty — https://4ort.xyz/entity/paris-a-polynomial-time-risk-sensitive-scheduling-algorithm-for-probabilistic-simple-temporal-networks-with-uncertainty (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/paris-a-polynomial-time-risk-sensitive-scheduling-algorithm-for-probabilistic-simple-temporal-networks-with-uncertainty · Last refreshed: