book chapter · Lecture notes in computer science · 2003

Performance Modeling for Dynamic Algorithm Selection

Michael O. McCracken, Allan Snavely, Allen D. Malony

Cited by 15Open access

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

McCracken, M. O., Snavely, A., & Malony, A. D. (2003). Performance Modeling for Dynamic Algorithm Selection. Lecture notes in computer science, 749–758. https://doi.org/10.1007/3-540-44864-0_77

MLA 9

McCracken, Michael O., et al. “Performance Modeling for Dynamic Algorithm Selection.” Lecture notes in computer science, 2003, pp. 749–58, https://doi.org/10.1007/3-540-44864-0_77.

Chicago

McCracken, Michael O., Allan Snavely, and Allen D. Malony. 2003. “Performance Modeling for Dynamic Algorithm Selection.” Lecture notes in computer science: 749–58. https://doi.org/10.1007/3-540-44864-0_77.

Harvard

McCracken, M.O., Snavely, A. and Malony, A.D. (2003) ‘Performance Modeling for Dynamic Algorithm Selection’, Lecture notes in computer science, pp. 749–758. Available at: https://doi.org/10.1007/3-540-44864-0_77.

BibTeX

@incollection{mccracken2003performance,
  title = {{Performance Modeling for Dynamic Algorithm Selection}},
  author = {McCracken, Michael O. and Snavely, Allan and Malony, Allen D.},
  booktitle = {Lecture notes in computer science},
  pages = {749--758},
  year = {2003},
  doi = {10.1007/3-540-44864-0_77}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.