ML Anthology

Evaluating Consistency Algorithms for Temporal Metric Constraints

Yang Shi, Anagh Lal, Berthe Y. Choueiry
AAAI 2004 pp. 970-971
/aaai/2004/shi2004aaai-evaluating/

Abstract

1. A finer version of PPC. 2. Cheaper than PPC and F-W. 3. Guarantees the minimal network. 4. Automatically decomposes the graph into its bi-connected components: • binds effort in size of largest component. • allows parallellization. 5. Best known algorithm for computing the minimal network of an STP

PDF AAAI Semantic Scholar

Cite

Text

Shi et al. "Evaluating Consistency Algorithms for Temporal Metric Constraints." AAAI Conference on Artificial Intelligence, 2004.

Markdown

[Shi et al. "Evaluating Consistency Algorithms for Temporal Metric Constraints." AAAI Conference on Artificial Intelligence, 2004.](https://mlanthology.org/aaai/2004/shi2004aaai-evaluating/)

BibTeX

@inproceedings{shi2004aaai-evaluating,
  title     = {{Evaluating Consistency Algorithms for Temporal Metric Constraints}},
  author    = {Shi, Yang and Lal, Anagh and Choueiry, Berthe Y.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2004},
  pages     = {970-971},
  url       = {https://mlanthology.org/aaai/2004/shi2004aaai-evaluating/}
}