{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:05:26Z","timestamp":1729645526866,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/icmlc.2011.6016787","type":"proceedings-article","created":{"date-parts":[[2011,9,21]],"date-time":"2011-09-21T16:16:22Z","timestamp":1316621782000},"page":"785-788","source":"Crossref","is-referenced-by-count":3,"title":["Solving Japanese puzzles by genetic algorithms"],"prefix":"10.1109","author":[{"given":"Jinn-Tsong","family":"Tsai","sequence":"first","affiliation":[]},{"given":"Ping-Yi","family":"Chou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"NP-completeness results for nonograms via parsimonious reductions","author":"ueda","year":"1996","journal-title":"Technical Report TR96–0008"},{"key":"ref11","first-page":"243","article-title":"A discrete tomography approach to Japanese puzzles","author":"batenburg","year":"2004","journal-title":"Proc Belgian-Dutch Conf Artificial Intelligence"},{"key":"ref12","article-title":"A combinatorial problem associated with nonograms","author":"benton","year":"2005","journal-title":"Technical Report Artificial Intelligence Dept"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TE.2007.893170"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78275-9_33"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.12.003"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLC.2009.5212614"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s12065-009-0030-3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006529012972"},{"journal-title":"Genetic Algorithms and Engineering Design","year":"1997","author":"gen","key":"ref3"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/00207729708929359","article-title":"A genetic algorithm applied to a classic job-shop scheduling problem","volume":"28","author":"shi","year":"1997","journal-title":"Int J of Systems Science"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1994.400072"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s001700200126"},{"key":"ref7","first-page":"133","article-title":"Improved genetic algorithms for solving job-shop scheduling problem","volume":"3","author":"tsujimura","year":"1997","journal-title":"Engineering Design and Automation"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03315-9"},{"journal-title":"Genetic Algorithms in Search Optimization and Machine Learning","year":"1989","author":"goldberg","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-004-2283-4"}],"event":{"name":"2011 International Conference on Machine Learning and Cybernetics (ICMLC)","start":{"date-parts":[[2011,7,10]]},"location":"Guilin, China","end":{"date-parts":[[2011,7,13]]}},"container-title":["2011 International Conference on Machine Learning and Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6009138\/6016754\/06016787.pdf?arnumber=6016787","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T02:43:59Z","timestamp":1497926639000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6016787\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/icmlc.2011.6016787","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}