1 |
Michael R. Fellows, et al., "Local Search: Is brute-force avoidable?," J. Comput. Syst. Sci. (JCSS), vol.78, no.3, p.707-719, 2012. DOI: http://dx.doi.org/10.1016/j.jcss.2011.10.003
DOI
ScienceOn
|
2 |
A. B. Morton, I. M. Y. Mareels, "An Efficient Brute Force Solution to the Network Reconf. Problem," IEEE Trans. on Power Delivery, vol.15, p.996-1000, Jul. 2000. DOI: http://dx.doi.org/10.1109/61.871365
DOI
ScienceOn
|
3 |
L. Barton, B. Sharangpani, "Statistical Analysis of Floating Point Flaw in the Pentium Processor," Intel Corp., Nov. 1994.
|
4 |
Cleve Moler, "Pentium Division Bug Documents," MATLAB Central, May 2002.
|
5 |
Selim G. Akl, Henk Meijer, Ivan Stojmenovic, "An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order," J. Parallel Distr. Comput., vol.20 no.1, pp.84-91, 1994. DOI: http://dx.doi.org/10.1006/jpdc.1994.1008
DOI
ScienceOn
|
6 |
Vince Vatter, "Enumeration Schemes for Restricted Permutations," Combinatorics, Probability and Comp., vol.17, p.137-159, 2008. DOI: http://dx.doi.org/10.1017/S0963548307008516
DOI
ScienceOn
|
7 |
Hesterberg, Tim C., "Perf. Evaluation using Fast Permutation Tests," Proc. of 10'th Int. Conf. on Telecomm. Systems, p.465-474, 2002.
|
8 |
Skiena S., "Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica," Addison-Wesley, p.40-46, 1990.
|
9 |
Selmer M. Johnson, "Generation of Permutations by Adjacent Transposition," Mathematics of Computation, vol.17, no.83, p.282-285, Jul. 1963. DOI: http://dx.doi.org/10.1090/S0025-5718-1963-0159764-2
DOI
ScienceOn
|
10 |
Youssef Bassil, "A Comparative Study on the Performance of Permutation Algorithms," Journal of Computer Science & Research(JCSCR), vol.1, no.1, p.7-19, 2012.
|
11 |
H. F. Trotter, "Algorithm 115: Perm," Communications of the ACM, vol.5, issue.8, p.434-435, Aug. 1962. DOI: http://dx.doi.org/10.1145/368637.368660
DOI
|