{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:18:09Z","timestamp":1748405889048,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319190655"},{"type":"electronic","value":"9783319190662"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19066-2_3","type":"book-chapter","created":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T01:20:34Z","timestamp":1430356834000},"page":"23-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Longest Paths in Hypercubes: 11 New Lower Bounds for Snakes, Coils, and Symmetrical Coils"],"prefix":"10.1007","author":[{"given":"Seth J.","family":"Meyerson","sequence":"first","affiliation":[]},{"given":"Thomas E.","family":"Drapela","sequence":"additional","affiliation":[]},{"given":"William E.","family":"Whiteside","sequence":"additional","affiliation":[]},{"given":"Walter D.","family":"Potter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,1]]},"reference":[{"key":"3_CR1","unstructured":"Potter W.: Snake-In-The-Box Dictionary (2014). http:\/\/ai1.ai.uga.edu\/sib\/sibwiki\/doku.php\/dictionary (accessed June 5, 2014)"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1109\/TEC.1958.5222529","volume":"EC-7","author":"W Kautz","year":"1958","unstructured":"Kautz, W.: Unit-distance Error-Checking Codes. IRE Trans. Electron. Comput. EC-7(2), 179\u2013180 (1958)","journal-title":"IRE Trans. Electron. Comput."},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.2307\/2316860","volume":"77","author":"V Klee","year":"1970","unstructured":"Klee, V.: What is the Maximum Length of a d-Dimensional Snake? The Amer. Math. Monthly 77(1), 63\u201365 (1970)","journal-title":"The Amer. Math. Monthly"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"2587","DOI":"10.1109\/18.945274","volume":"47","author":"A Hiltgen","year":"2000","unstructured":"Hiltgen, A., Paterson, K.: Single Track Circuit Codes. IEEE Trans. on Inform. Theory 47, 2587\u20132595 (2000)","journal-title":"IEEE Trans. on Inform. Theory"},{"issue":"2 suppl.","key":"3_CR5","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/s11771-008-0488-7","volume":"15","author":"F Zhang","year":"2008","unstructured":"Zhang, F., Zhu, H.: Determination of optimal period of absolute encoders with single track cyclic gray code. J. of Central South University of Technology 15(2 suppl.), 362\u2013366 (2008)","journal-title":"J. of Central South University of Technology"},{"key":"3_CR6","unstructured":"Blaum, M., Etzion, T.: \u201cUse of snake-in-the-box codes for reliable identification of tracks in servo fields of a disk drive,\u201d U.S. Patent 6 496 312, December 17, 2002"},{"issue":"8","key":"3_CR7","doi-asserted-by":"publisher","first-page":"5471","DOI":"10.1109\/TIT.2012.2196755","volume":"58","author":"Y Yehezkeally","year":"2012","unstructured":"Yehezkeally, Y., Schwartz, M.: Snake-in-the-Box Codes for Rank Modulation. IEEE Trans. Information Theory 58(8), 5471\u20135483 (2012)","journal-title":"IEEE Trans. Information Theory"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TIT.2009.2037078","volume":"56","author":"I Zinovik","year":"2010","unstructured":"Zinovik, I., Chebiryak, Y., Kroening, D.: Periodic Orbits and Equilibria in Glass Models for Gene Regulatory Networks. IEEE Trans. Information Theory 56(2), 805\u2013820 (2010)","journal-title":"IEEE Trans. Information Theory"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1109\/PGEC.1965.264259","volume":"14","author":"D Davies","year":"1965","unstructured":"Davies, D.: Longest \u2018separated\u2019 paths and loops in an N cube. IEEE Trans. Electron. Comput. 14, 261 (1965)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"3_CR10","unstructured":"Potter, W., Robinson, J., Miller J., Kochut, K.: Using the genetic algorithm to find snake-in-the-box codes. In: Proc. 7th Int. Conf. Industrial & Engineering Applications of Artificial Intelligence and Expert Systems, Austin, TX, pp. 421\u2013426 (1994)"},{"key":"3_CR11","first-page":"175","volume":"20","author":"K Kochut","year":"1996","unstructured":"Kochut, K.: Snake-In-The-Box Codes for Dimension 7. J. Combinatorial Math. and Combinatorial Computing 20, 175\u2013185 (1996)","journal-title":"J. Combinatorial Math. and Combinatorial Computing"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Kinny, D.: A new approach to the snake-in-the-box problem. In: Proc. 20th European Conf. Artificial Intelligence, ECAI 2012, Montpellier, France, 2012 \u00a9 The Author. doi:10.3233\/978-1-61499-098-7-462","DOI":"10.3233\/978-1-61499-098-7-462"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Carlson, B., Hougen, D.: Phenotype feedback genetic algorithm operators for heuristic encoding of snakes within hypercubes. In: Proc. 12th Annu. Genetic and Evolutionary Computation Conf., GECCO 2010, Portland, Oregon, pp. 791\u2013798 (2010)","DOI":"10.1145\/1830483.1830622"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-35455-7_25","volume-title":"Multi-disciplinary Trends in Artificial Intelligence","author":"D Kinny","year":"2012","unstructured":"Kinny, D.: Monte-carlo search for snakes and coils. In: Sombattheera, C., Loi, N.K., Wankar, R., Quan, T. (eds.) MIWAI 2012. LNCS, vol. 7694, pp. 271\u2013283. Springer, Heidelberg (2012)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Brooks, P.: Particle Swarm Optimization and Priority Representation: M.S. thesis, Artificial Intelligence, Univ. Georgia, Athens (2012)","DOI":"10.1007\/978-3-642-21827-9_32"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Casella, D., Potter, W.: Using evolutionary techniques to hunt for snakes and coils. In: Proc. IEEE Congress on Evolutionary Computation, CEC 2005, Edinburgh, Scotland, pp. 2499\u20132505 (2005)","DOI":"10.1109\/CEC.2005.1555007"},{"key":"3_CR17","unstructured":"Juric, M., Potter, W., Plaskin, M.: Using the parallel virtual machine for hunting snake-in-the-box codes. In: Proc. 7th Conf. North American Transputer Research and Applications Conf., NATUG-7, Athens, GA, pp. 97\u2013102 (1994)"},{"key":"3_CR18","unstructured":"Bishopm, J.: Investigating the snake-in-the-box problem with neuroevolution. Dept. of Computer Science, Univ. Texas, Austin (2006)"},{"key":"3_CR19","unstructured":"Adelson, L., Alter, R., Curtz, T.: Long snakes and a characterization of maximal snakes on the d-cube. In: Proc. 4th SouthEastern Conf. Combinatorics, Graph Theory, and Computing, Congr. No. 8, Boca Raton, FL, pp. 111\u2013124 (1973)"},{"key":"3_CR20","first-page":"97","volume":"40","author":"H Abbott","year":"1991","unstructured":"Abbott, H., Katchalski, M.: On the Construction of Snake in the Box Codes. Utilitas Mathematica 40, 97\u2013116 (1991)","journal-title":"Utilitas Mathematica"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Wynn, E.: Constructing circuit codes by permuting initial sequences. In: Proc. 20th European Conf. Artificial Intelligence, ECAI 2012, Montpellier, France, 2012 \u00a9 The Author. doi:10.3233\/978-1-61499-098-7-468 http:\/\/arxiv.org\/abs\/1201.1647 (accessed June 5, 2014)","DOI":"10.3233\/978-1-61499-098-7-468"},{"key":"3_CR22","unstructured":"Potter, W.: SIB Records (2014). http:\/\/ai.uga.edu\/sib\/sibwiki\/doku.php\/records (accessed June 5, 2014)"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Meyerson, S., Drapela, T., Whiteside, W. Potter, W.: Finding longest paths in hypercubes, snakes and coils. In: Proc. 2014 IEEE Symp. Computational Intelligence for Engineering Solutions, CIES 2014, Orlando, FL, pp. 103-109 (2014)","DOI":"10.1109\/CIES.2014.7011838"},{"key":"3_CR24","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M Pinedo","year":"1995","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, New York (1995)"},{"key":"3_CR25","unstructured":"Tuohy, D., Potter, W., Casella, D.: \u201cSearching for snake-in-the-box codes with evolved pruning models. In: Proc. 2007 Int. Conf. Genetic and Evolutionary Methods, GEM 2007, Las Vegas, NV, pp. 3\u20139 (2007)"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Diaz-Gomez, P., Hougen, D.: Genetic algorithms for hunting snakes in hypercubes: fitness function analysis and open questions. In: 7th ACIS Int. Conf. Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing, SNPD 2006, Las Vegas, NV, pp. 389\u2013394 (2006)","DOI":"10.1109\/SNPD-SAWN.2006.41"}],"container-title":["Lecture Notes in Computer Science","Current Approaches in Applied Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19066-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T18:03:39Z","timestamp":1748369019000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19066-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319190655","9783319190662"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19066-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}