{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:36Z","timestamp":1740099156801,"version":"3.37.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030000141"},{"type":"electronic","value":"9783030000158"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00015-8_49","type":"book-chapter","created":{"date-parts":[[2018,9,12]],"date-time":"2018-09-12T16:14:23Z","timestamp":1536768863000},"page":"563-575","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Dominance-Based Constrained Optimization Evolutionary Algorithm for the 4-th Tensor Power Problem of Matrix Multiplication"],"prefix":"10.1007","author":[{"given":"Langping","family":"Tang","sequence":"first","affiliation":[]},{"given":"Yuren","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Zefeng","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,13]]},"reference":[{"key":"49_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1976","unstructured":"Aho, A.V., Hopcroft, J.E.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Wokingham (1976)"},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/0020-0190(79)90113-3","volume":"8","author":"D Bini","year":"1979","unstructured":"Bini, D., Capovani, M., Romani, F., Lotti, G.: 0(n2.7799) complexity for n $$\\times $$ n approximate matrix multiplication. Inf. Process. Lett. 8, 234\u2013235 (1979)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"49_CR3","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1109\/TEVC.2006.872344","volume":"10","author":"Z Cai","year":"2006","unstructured":"Cai, Z., Wang, Y.: A multiobjective optimization-based evolutionary algorithm for constrained optimization. IEEE Trans. Evol. Comput. 10(6), 658\u2013675 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"49_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1080\/03052150008941301","volume":"32","author":"CAC Coello","year":"2000","unstructured":"Coello, C.A.C.: Treating constraints as objectives for single-objective evolutionary optimization. Eng. Optim. 32(3), 275\u2013308 (2000)","journal-title":"Eng. Optim."},{"issue":"11\u201312","key":"49_CR5","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"CAC Coello","year":"2002","unstructured":"Coello, C.A.C.: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput. Methods Appl. Mech. Eng. 191(11\u201312), 1245\u20131287 (2002)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Winograd, S.: On the asymptotic complexity of matrix multiplication. In: Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, pp. 82\u201390 (1981)","DOI":"10.1109\/SFCS.1981.27"},{"key":"49_CR7","doi-asserted-by":"publisher","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 1\u20136. ACM, New York (1987). https:\/\/doi.org\/10.1145\/28395.28396","DOI":"10.1145\/28395.28396"},{"key":"49_CR8","unstructured":"Johnson, S.G.: The NLopt nonlinear-optimization package. http:\/\/ab-initio.mit.edu\/nlopt"},{"issue":"1976","key":"49_CR9","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1090\/S0002-9904-1976-13988-2","volume":"82","author":"JD Laderman","year":"1976","unstructured":"Laderman, J.D.: A noncommutative algorithm for multiplying 33 matrices using 23 multiplications. Bull. Am. Math. Soc. 82(1976), 126\u2013128 (1976)","journal-title":"Bull. Am. Math. Soc."},{"issue":"1","key":"49_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz, Z., Schoenauer, M., Schoenauer, M.: Evolutionary algorithms for constrained parameter optimization problems. Evol. Comput. 4(1), 1\u201332 (1996)","journal-title":"Evol. Comput."},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Pan, V.Y.: Strassen\u2019s algorithm is not optimal. In: Proceedings of FOCS, vol. 19, pp. 166\u2013176 (1978)","DOI":"10.1080\/00107517808210880"},{"issue":"2","key":"49_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1137\/0211020","volume":"11","author":"F Romani","year":"1982","unstructured":"Romani, F.: Some properties of disjoint sums of tensors related to matrix multiplication. SIAM J. Comput. 11(2), 263\u2013267 (1982)","journal-title":"SIAM J. Comput."},{"key":"49_CR13","unstructured":"Satoh, H., Yamamura, M., Kobayashi, S.: Minimal generation gap model for gas considering both exploration and expolation. In: Proceedings of Fourth International Conference on Soft Computation, pp. 494\u2013497 (1997)"},{"issue":"3","key":"49_CR14","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1137\/0210032","volume":"10","author":"A Sch\u00f6nhage","year":"1981","unstructured":"Sch\u00f6nhage, A.: Partial and total matrix multiplication. SIAM J. Comput. 10(3), 434\u2013455 (1981). https:\/\/doi.org\/10.1137\/0210032","journal-title":"SIAM J. Comput."},{"key":"49_CR15","unstructured":"Stothers, A.J.: On the complexity of matrix multiplication (2010)"},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Strassen, V.: The asymptotic spectrum of tensors and the exponent of matrix multiplication. In: Proceedings of Annual Symposium on Foundations of Computer Science, pp. 49\u201354 (1986)","DOI":"10.1109\/SFCS.1986.52"},{"issue":"375\u2013376","key":"49_CR17","first-page":"406","volume":"1987","author":"V Strassen","year":"1987","unstructured":"Strassen, V.: Relative bilinear complexity and matrix multiplication. Journal Fr Die Reine Und Angewandte Mathematik 1987(375\u2013376), 406\u2013443 (1987)","journal-title":"Journal Fr Die Reine Und Angewandte Mathematik"},{"issue":"4","key":"49_CR18","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik 13(4), 354\u2013356 (1969)","journal-title":"Numerische Mathematik"},{"key":"49_CR19","unstructured":"Tsutsui, S.: Multi-parent recombination with simplex crossover in real coded genetic algorithms. In: GECCO, pp. 657\u2013664 (1999)"},{"issue":"4","key":"49_CR20","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/TEVC.2005.846817","volume":"9","author":"S Venkatraman","year":"2005","unstructured":"Venkatraman, S., Yen, G.G.: A generic framework for constrained optimization using genetic algorithms. IEEE Trans. Evol. Comput. 9(4), 424\u2013435 (2005)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"49_CR21","doi-asserted-by":"crossref","unstructured":"Williams, V.V.: Multiplying matrices faster than Coppersmith-Winograd. In: Forty-Fourth ACM Symposium on Theory of Computing, pp. 887\u2013898 (2012)","DOI":"10.1145\/2213977.2214056"},{"key":"49_CR22","unstructured":"Williams, V.V.: Multiplying matrices in o(n2.373) time (2014). http:\/\/theory.stanford.edu\/~virgi\/matrixmult-f.pdf"},{"issue":"1","key":"49_CR23","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/TEVC.2016.2567648","volume":"21","author":"Y Zhou","year":"2017","unstructured":"Zhou, Y., Chen, Z., Zhang, J.: Ranking vectors by means of the dominance degree matrix. IEEE Trans. Evol. Comput. 21(1), 34\u201351 (2017). https:\/\/doi.org\/10.1109\/TEVC.2016.2567648","journal-title":"IEEE Trans. Evol. Comput."},{"key":"49_CR24","unstructured":"Zhou, Y., Li, Y., He, J., Kang, L.: Multi-objective and MGG evolutionary algorithm for constrained optimization. In: The 2003 Congress on Evolutionary Computation, CEC 2003, vol. 1, pp. 1\u20135 (2004)"}],"container-title":["Lecture Notes in Computer Science","Cloud Computing and Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00015-8_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T17:17:38Z","timestamp":1604942258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00015-8_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030000141","9783030000158"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00015-8_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ICCCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cloud Computing and Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Haikou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"incodldos2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icccsconf.org\/icccs2018.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}