Author:
Rodriguez-Tello Eduardo,Torres-Jimenez Jose
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Kambayashi, Y., Cha, B., Iwama, K., Miyasaki, S.: Local search algorithms for partial maxsat. In: Proceedings of the AAAI 1997, July 27-31, pp. 263–268 (1997)
2. Blickle, T., Thiele, L.: A mathematical analysis of tournament selection. In: Proceedings of the Sixth ICGA, pp. 9–16. Morgan Kaufmann Publishers, San Francisco (1995)
3. Chinn, P.Z., Chvatalova, J., Dewdney, A.K., Gibbs, N.E.: The bandwidth problem for graphs and matrices - a survey. Journal of Graph Theory 6(3), 223–254 (1982)
4. Cook, S.A.: The complexity of theorem proving procedures. In: 3rd Annual ACM Symposium on the Theory of Computing, pp. 151–158 (1971)
5. Cutchill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings 24th National of the ACM, pp. 157–172 (1969)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Importance of finding a good basis in binary representation;Proceedings of the Genetic and Evolutionary Computation Conference Companion;2018-07-06