On the Differences between "Practical" and "Applied"
暂无分享,去创建一个
[1] Catherine C. McGeoch. Feature Article - Toward an Experimental Method for Algorithm Simulation , 1996, INFORMS J. Comput..
[2] Karsten Weihe,et al. On the discrete core of quadrilateral mesh refinement , 1999 .
[3] Catherine C. McGeoch. Analyzing algorithms by simulation: variance reduction techniques and simulation speedups , 1992, CSUR.
[4] John N. Hooker,et al. Testing heuristics: We have it all wrong , 1995, J. Heuristics.
[5] Ulrik Brandes,et al. Empirical design of geometric algorithms , 1999, SCG '99.
[6] David S. Johnson,et al. A theoretician's guide to the experimental analysis of algorithms , 1999, Data Structures, Near Neighbor Searches, and Methodology.
[7] Steven Skiena,et al. The Algorithm Design Manual , 2020, Texts in Computer Science.
[8] Stephen G. Nash,et al. Guidelines for reporting results of computational experiments. Report of the ad hoc committee , 1991, Math. Program..
[9] Karsten Weihe,et al. Why CAD Data Repair Requires Discrete Techniques , 1998 .
[10] Michael Pinedo,et al. GUIDELINES FOR REPORTING COMPUTATIONAL RESULTS IN IIE TRANSACTIONS , 1993 .
[11] John N. Hooker,et al. Needed: An Empirical Science of Algorithms , 1994, Oper. Res..
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[13] Karsten Weihe,et al. Reconstructing the Topology of a CAD Model—a Discrete Approach , 2000, Algorithmica.
[14] Rolf H. Möhring,et al. Mesh refinement via bidirected flows: modeling, complexity, and computational results , 1997, JACM.