Towards A Discipline Of Experimental Algorithmics


Download Links

by Bernard M. E. Moret
Citations:38 - 8 self

Active Bibliography

DIMACS Series in Discrete Mathematics and Theoretical Computer Science Towards a Discipline of Experimental Algorithmics – Bernard M. E. Moret
9 Algorithms and Experiments: The New (and Old) Methodology – Bernard M. E. Moret, Henry D. Shapiro - 2001
641 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999
688 How to model an internetwork – E W Zegura, K Calvert, S Bhattacharjee - 1996
1467 The structure and function of complex networks – M. E. J. Newman - 2003
832 An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision – Yuri Boykov, Vladimir Kolmogorov - 2001
654 Ant Colony System: A cooperative learning approach to the traveling salesman problem – Marco Dorigo, Luca Maria Gambardella - 1997
685 A New Method for Solving Hard Satisfiability Problems – Bart Selman, Hector Levesque, David Mitchell - 1992
435 Planning as satisfiability – Henry Kautz, Bart Selman - 1992