Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Independent Processes

Cite

Text

Finkelstein et al. "Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Independent Processes." AAAI Conference on Artificial Intelligence, 2002.

Markdown

[Finkelstein et al. "Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Independent Processes." AAAI Conference on Artificial Intelligence, 2002.](https://mlanthology.org/aaai/2002/finkelstein2002aaai-optimal/)

BibTeX

@inproceedings{finkelstein2002aaai-optimal,
  title     = {{Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Independent Processes}},
  author    = {Finkelstein, Lev and Markovitch, Shaul and Rivlin, Ehud},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2002},
  pages     = {719-724},
  url       = {https://mlanthology.org/aaai/2002/finkelstein2002aaai-optimal/}
}