{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:01:25Z","timestamp":1725544885913},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422372"},{"type":"electronic","value":"9783540457237"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45723-2_17","type":"book-chapter","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T14:39:51Z","timestamp":1265899191000},"page":"144-151","source":"Crossref","is-referenced-by-count":0,"title":["Analyzing Boltzmann Machine Parameters for Fast Convergence"],"prefix":"10.1007","author":[{"given":"Fco.","family":"Javier Salcedo","sequence":"first","affiliation":[]},{"given":"Julio","family":"Ortega","sequence":"additional","affiliation":[]},{"given":"Alberto","family":"Prieto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,12]]},"reference":[{"key":"17_CR1","volume-title":"Simulated Annealing and Boltzmann Machines","author":"E.H.L. Aarts","year":"1989","unstructured":"Aarts, E.H.L., Korst, J.H.M.: Simulated Annealing and Boltzmann Machines. Wiley, New York (1989)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Chow, F., Hennessy, J.: Register Allocation by Priority-Based Colouring. Proceedings of the ACM SIGPLAN\u2019 84. Symposium on Compiler Construction SIGPLAN Notices, vol. 19,num.6, (June 1984)","DOI":"10.1145\/502949.502896"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1023\/A:1009689415274","volume":"7","author":"J. Ortega","year":"1998","unstructured":"Ortega, J., and others: Parallel Coarse Grain Computing of Boltzmann Machines. Neural Processing Letters 7: 169\u2013184, (1998)","journal-title":"Neural Processing Letters"},{"issue":"5","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1162\/089976698300017386","volume":"10","author":"H.J. Kappen","year":"1998","unstructured":"Kappen, H.J., Rodr\u00edguez, F.B.: Efficient Learning in Boltzmann Machines Using Linear Response Theory. Neural Computation 10(5): 1137\u20131156, (1998)","journal-title":"Neural Computation"},{"key":"17_CR5","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NPCompleteness. Freeman (1979)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Zissimopoulos, V., Paschos, V.Th., Pekergin, F.:On the Approximation of NP-Complete Problems by Using the Bolzmann Machine Method: The Cases of Some Covering and Packing Problems. IEEE Transactions on Computers, vol. 40,num. 12, (December 1991)","DOI":"10.1109\/12.106226"}],"container-title":["Lecture Notes in Computer Science","Bio-Inspired Applications of Connectionism"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45723-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T18:29:51Z","timestamp":1558808991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45723-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422372","9783540457237"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-45723-2_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}