Analysis of algorithms. An active learning approach

MaRDI QIDQ2864283zbMATH OpenFDO

Authors Jeffrey J. McConnell

Publication date 6 December 2013

zbMATH Keywords

dynamic programminggraph algorithmsgreedy approximationmatchingnondeterministic algorithmsnumeric algorithmparallel algorithmsprobabilistic algorithmssearchingselectionsorting

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematics education (97-01) Theoretical computer science (educational aspects) (97P20)

Recommendations

• scientific article; zbMATH DE number 2343061
• Algorithms. Design and analysis
• scientific article; zbMATH DE number 1052004
• scientific article; zbMATH DE number 194559
• scientific article; zbMATH DE number 108389

Cited in

(4)

• Optimization of frame representations for compressed sensing and Mercedes-Benz frame
• An experimental method for the active learning of greedy algorithms
• Learning Theory
• scientific article; zbMATH DE number 2343061 (Why is no real title available?)

This page was built for publication: Analysis of algorithms. An active learning approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864283)