Using finite experiments to study asymptotic performance

DOI10.1007/3-540-36383-1_5MaRDI QIDQ4417674zbMATH OpenFDO

Authors Catherine C. McGeoch, Peter Sanders, Rudolf Fleischer, Doina Precup, Paul R. Cohen

Publication date 29 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2547/25470093.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 2065614
• Feature Article—Toward an Experimental Method for Algorithm Simulation
• Algorithms and experiments: The new (and old) methodology
• Automatic average-case analysis of algorithms
• Needed: An Empirical Science of Algorithms

Cited in

(8)

• Testing heuristics: We have it all wrong
• Reachability problem in non-uniform cellular automata
• Needed: An Empirical Science of Algorithms
• scientific article; zbMATH DE number 2065614 (Why is no real title available?)
• Customizable contraction hierarchies
• A machine-discovery approach to the evaluation of hashing techniques
• Shell sort with expected complexity of O(n _2 n)
• Testing cut generators for mixed-integer linear programming

Describes a project that uses

Uses Software

• MersenneTwister

This page was built for publication: Using finite experiments to study asymptotic performance

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