{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:35:21Z","timestamp":1726065321510},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030386283"},{"type":"electronic","value":"9783030386290"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-38629-0_5","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:05:05Z","timestamp":1579597505000},"page":"53-68","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["How to Use Boltzmann Machines and Neural Networks for Covering Array Generation"],"prefix":"10.1007","author":[{"given":"Ludwig","family":"Kampel","sequence":"first","affiliation":[]},{"given":"Michael","family":"Wagner","sequence":"additional","affiliation":[]},{"given":"Ilias S.","family":"Kotsireas","sequence":"additional","affiliation":[]},{"given":"Dimitris E.","family":"Simos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"key":"5_CR1","volume-title":"Simulated Annealing and Boltzmann Machines","author":"E Aarts","year":"1988","unstructured":"Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines. Wiley, Hoboken (1988)"},{"issue":"6","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1016\/j.scient.2011.08.031","volume":"18","author":"M Bashiri","year":"2011","unstructured":"Bashiri, M., Geranmayeh, A.F.: Tuning the parameters of an artificial neural network using central composite design and genetic algorithm. Scientia Iranica 18(6), 1600\u20131608 (2011)","journal-title":"Scientia Iranica"},{"issue":"13","key":"5_CR3","doi-asserted-by":"publisher","first-page":"2079","DOI":"10.1016\/S0960-0779(99)00104-6","volume":"11","author":"M Hifi","year":"2000","unstructured":"Hifi, M., Paschos, V.T., Zissimopoulos, V.: A neural network for the minimum set covering problem. Chaos, Solitons Fractals 11(13), 2079\u20132089 (2000)","journal-title":"Chaos, Solitons Fractals"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.endm.2018.02.014","volume":"65","author":"L Kampel","year":"2018","unstructured":"Kampel, L., Garn, B., Simos, D.E.: Covering arrays via set covers. Electron. Notes Discrete Math. 65, 11\u201316 (2018)","journal-title":"Electron. Notes Discrete Math."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.tcs.2019.10.019","volume":"800","author":"L Kampel","year":"2019","unstructured":"Kampel, L., Simos, D.E.: A survey on the state of the art of complexity problems for covering arrays. Theoret. Comput. Sci. 800, 107\u2013124 (2019)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01582166","volume":"34","author":"M Lundy","year":"1986","unstructured":"Lundy, M., Mees, A.: Convergence of an annealing algorithm. Math. Program. 34(1), 111\u2013124 (1986)","journal-title":"Math. Program."},{"key":"5_CR7","unstructured":"Ma, L., et al.: Combinatorial testing for deep learning systems. arXiv preprint arXiv:1806.07723 (2018)"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.13053\/rcs-121-1-6","volume":"121","author":"H P\u00e9rez-Espinosa","year":"2016","unstructured":"P\u00e9rez-Espinosa, H., Avila-George, H., Rodriguez-Jacobo, J., Cruz-Mendoza, H.A., Mart\u00ednez-Miranda, J., Espinosa-Curiel, I.: Tuning the parameters of a convolutional artificial neural network by using covering arrays. Res. Comput. Sci. 121, 69\u201381 (2016)","journal-title":"Res. Comput. Sci."},{"issue":"7676","key":"5_CR9","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1038\/nature24270","volume":"550","author":"D Silver","year":"2017","unstructured":"Silver, D., et al.: Mastering the game of Go without human knowledge. Nature 550(7676), 354 (2017)","journal-title":"Nature"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/ijoc.11.1.15","volume":"11","author":"KA Smith","year":"1999","unstructured":"Smith, K.A.: Neural networks for combinatorial optimization: a review of more than a decade of research. INFORMS J. Comput. 11(1), 15\u201334 (1999)","journal-title":"INFORMS J. Comput."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Torres-Jimenez, J., Izquierdo-Marquez, I.: Survey of covering arrays. In: 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 20\u201327, September 2013","DOI":"10.1109\/SYNASC.2013.10"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2013","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-662-04565-7"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38629-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T23:06:48Z","timestamp":1614035208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38629-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030386283","9783030386290"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38629-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chania, Crete","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion13.pem.tuc.gr\/en\/home\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}