{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:54:07Z","timestamp":1760597647276,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1109\/cies.2014.7011838","type":"proceedings-article","created":{"date-parts":[[2015,1,21]],"date-time":"2015-01-21T19:35:59Z","timestamp":1421868959000},"page":"103-109","source":"Crossref","is-referenced-by-count":5,"title":["Finding longest paths in hypercubes, snakes and coils"],"prefix":"10.1109","author":[{"given":"S. J.","family":"Meyerson","sequence":"first","affiliation":[]},{"given":"W.E.","family":"Whiteside","sequence":"additional","affiliation":[]},{"given":"T.E.","family":"Drapela","sequence":"additional","affiliation":[]},{"given":"W.D.","family":"Potter","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Investigating the Snake-in-the-box Problem with Neuroevolution","year":"2006","author":"bishop","key":"19"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2005.1555007"},{"key":"18","article-title":"Using pvm for hunting snake-in-the-box codes","author":"juric","year":"1994","journal-title":"Proceedings of the 7th Conference of the North American Transputer Users Group"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35455-7_25"},{"journal-title":"Particle Swarm Optimization and Priority Representation (MS Thesis)","year":"2012","author":"brooks","key":"16"},{"key":"13","article-title":"New approach to the snake-in-the-box problem","author":"kinny","year":"2012","journal-title":"ECAI 2012-20th European Conference on Artificial Intelligence Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830622"},{"key":"11","article-title":"Using the genetic algorithm to find snake-in-the-box codes","author":"potter","year":"1994","journal-title":"Proceeding of the 7th International Conference on Industrial & Engineering Applications of Artificial Intelligence and Expert Systems 1994"},{"key":"12","first-page":"175","article-title":"Snake-in-the-box codes for dimension 7","volume":"20","author":"kochut","year":"1996","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"21","first-page":"97","article-title":"On the construction of snake in the box codes","author":"abbott","year":"1991","journal-title":"Utilitas Mathematica"},{"key":"20","article-title":"Long snakes and a characterization of maximal snakes on the d-cube","author":"adelson","year":"1973","journal-title":"Proceedings of the Fourth Southeastern Conference on Combinatorics Graph Theory and Computing"},{"journal-title":"Constructing Circuit Codes by Permuting Initial Sequences","year":"0","author":"wynn","key":"22"},{"journal-title":"SIB Records","year":"2014","author":"potter","key":"23"},{"journal-title":"Scheduling Theory Algorithms and Systems","year":"1995","author":"pinedo","key":"24"},{"journal-title":"Beam Search","year":"0","author":"howe","key":"25"},{"journal-title":"Artificial Intelligence A Modern Approach 2nd Edition","year":"2010","author":"russell","key":"26"},{"key":"27","article-title":"Searching for snake-in-the-box codes with evolved pruning models","author":"tuohy","year":"2007","journal-title":"Proceedings of the 2007 International Conference on Genetic and Evolutionary Methods GEM 2007"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/SNPD-SAWN.2006.41"},{"key":"3","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/TEC.1958.5222529","article-title":"Unit-distance error-checking codes","volume":"ec 7","author":"kautz","year":"1958","journal-title":"IRE Trans Electronic Computers"},{"journal-title":"Snake-In-The-Box Dictionary","year":"2014","author":"potter","key":"2"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1965.264259"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"1"},{"journal-title":"Use of Snake-in-the-box Codes for Reliable Identification of Tracks in Servo Fields of A Disk Drive","year":"2002","author":"blaum","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s11771-008-0488-7"},{"key":"5","doi-asserted-by":"crossref","first-page":"2587","DOI":"10.1109\/18.945274","article-title":"Single track circuit codes","volume":"47","author":"hiltgen","year":"2000","journal-title":"IEEE Transactions on Information Theory"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.2307\/2316860"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2037078"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284107"}],"event":{"name":"2014 IEEE Symposium on Computational Intelligence for Engineering Solutions (CIES)","start":{"date-parts":[[2014,12,9]]},"location":"Orlando, FL, USA","end":{"date-parts":[[2014,12,12]]}},"container-title":["2014 IEEE Symposium on Computational Intelligence for Engineering Solutions (CIES)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7000187\/7011818\/07011838.pdf?arnumber=7011838","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T04:03:30Z","timestamp":1498190610000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7011838\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/cies.2014.7011838","relation":{},"subject":[],"published":{"date-parts":[[2014,12]]}}}