{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T04:04:52Z","timestamp":1749787492576,"version":"3.41.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Processing Letters"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1023\/a:1011369322571","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T09:44:13Z","timestamp":1040636653000},"page":"75-83","source":"Crossref","is-referenced-by-count":10,"title":["Combining the Perceptron Algorithm with Logarithmic Simulated Annealing"],"prefix":"10.1007","volume":"14","author":[{"given":"A.","family":"Albrecht","sequence":"first","affiliation":[]},{"given":"C. K.","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"324840_CR1","volume-title":"Simulated Annealing and Boltzmann Machines: A Stochastic Approach","author":"E. H. L. Aarts","year":"1989","unstructured":"Aarts, E. H. L. and Korst, J. H. M.: Simulated Annealing and Boltzmann Machines: A Stochastic Approach, Wiley & Sons, New York, 1989."},{"issue":"3","key":"324840_CR2","first-page":"382","volume":"6","author":"S. Agmon","year":"1959","unstructured":"Agmon, S.: The relaxation method for linear inequalities. Canadian J. of Mathematics, 6(3), (1959), 382\u2013392.","journal-title":"Canadian J. of Mathematics"},{"issue":"2","key":"324840_CR3","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1006\/jcph.1997.5781","volume":"136","author":"A. Albrecht","year":"1997","unstructured":"Albrecht, A., Cheung, S. K., Leung, K. S., and Wong, C. K.: Stochastic simulations of two-dimensional composite packings. J. of Computational Physics, 136(2) (1997), 559\u2013579.","journal-title":"J. of Computational Physics"},{"key":"324840_CR4","series-title":"LNCS Series","first-page":"301","volume-title":"Proc. IFIP International Conference on Theoretical Computer Science","author":"A. Albrecht","year":"2000","unstructured":"Albrecht, A. and Wong, C. K.: On Logarithmic Simulated Annealing. In: J. van Leeuwen, O. Watanabe, M. Hagiya, P. D. Mosses, T. Ito, eds., Proc. IFIP International Conference on Theoretical Computer Science, Tohoku University, Sendai, Japan, August 17\u201319, 2000, LNCS Series, vol. 1872, Springer-Verlag, pp. 301\u2013314."},{"issue":"2","key":"324840_CR5","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1162\/neco.1990.2.2.248","volume":"2","author":"E. B. Baum","year":"1990","unstructured":"Baum, E. B.: The perceptron algorithm is fast for nonmalicious distributions. Neural Computation, 2(2) (1990), 248\u2013260.","journal-title":"Neural Computation"},{"issue":"1\/2","key":"324840_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/PL00013833","volume":"22","author":"A. Blum","year":"1998","unstructured":"Blum, A., Freze, A., Kannan, R., and Vempala, S.: A polynomial-time algorithm for learning noisy linear threshold functions, Algorithmica, 22(1\/2) (1998), 35\u201352.","journal-title":"Algorithmica"},{"issue":"1","key":"324840_CR7","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0893-6080(05)80010-3","volume":"5","author":"A. Blum","year":"1992","unstructured":"Blum, A. and Rivest, R. L.: Training a 3-node neural networks is NP-complete. Neural Networks, 5(1) (1992), 117\u2013127.","journal-title":"Neural Networks"},{"key":"324840_CR8","doi-asserted-by":"crossref","unstructured":"Bylander, T.: Learning linear threshold functions in the presence of classification noise. Proc. 7th Annual ACM Workshop on Computational Learning Theory, (1994), pp. 340\u2013347.","DOI":"10.1145\/180139.181176"},{"key":"324840_CR9","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1162\/neco.1995.7.2.370","volume":"7","author":"T. Bylander","year":"1995","unstructured":"Bylander, T.: Learning linear threshold approximations using perceptrons. Neutral Computation, 7 (1995), 370\u2013379.","journal-title":"Neutral Computation"},{"issue":"3","key":"324840_CR10","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1214\/aop\/1176989682","volume":"20","author":"O. Catoni","year":"1992","unstructured":"Catoni, O.: Rough large deviation estimates for simulated annealing: applications to exponential schedules. Annals of Probability, 20(3) (1992), 1109\u20131146.","journal-title":"Annals of Probability"},{"issue":"4","key":"324840_CR11","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1006\/jcom.1996.0035","volume":"12","author":"O. Catoni","year":"1996","unstructured":"Catoni, O.: Metropolis, simulated annealing, and iterated energy transformation algorithms: theory and experiments. J. of Complexity, 12(4) (1996), 595\u2013623.","journal-title":"J. of Complexity"},{"key":"324840_CR12","volume-title":"A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm","author":"V. \u010cerny","year":"1982","unstructured":"\u010cerny, V.: A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. Preprint, Inst. of Physics and Biophysics, Comenius Univ., Bratislava, 1982 (see also: J. Optim. Theory Appl., 45 (1985), 41\u201351."},{"key":"324840_CR13","doi-asserted-by":"crossref","unstructured":"Cohen, E.: Learning noisy perceptrons by a perceptron in polynomial time. In: Proc. 38th Annual IEEE Symposium on Foundatons of Computer Science, (1997), pp. 514\u2013523.","DOI":"10.1109\/SFCS.1997.646140"},{"issue":"2","key":"324840_CR14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/72.80230","volume":"1","author":"S. I. Gallant","year":"1999","unstructured":"Gallant, S. I.: Perceptron-based learning algorithms. IEEE Trans. on Neural Networks, 1(2) (1999), 179\u2013191.","journal-title":"IEEE Trans. on Neural Networks"},{"key":"324840_CR15","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B. Hajek","year":"1988","unstructured":"Hajek, B.: Cooling schedules for optimal annealing. Mathem. Oper. Res., 13 (1988), 311\u2013329.","journal-title":"Mathem. Oper. Res."},{"key":"324840_CR16","doi-asserted-by":"crossref","unstructured":"H\u00f6ffgen, K.-U. and Simon, H.-U.: Robust trainability of single neurons. In: Proc. 5th Annual ACM Workshop on Computational Learning, (1992), pp. 428\u2013439.","DOI":"10.1145\/130385.130431"},{"key":"324840_CR17","unstructured":"H\u00f6ffgen, K.-U.: Computational limitations on training sigmoid neural networks. In: Proc. 2nd International Conference on Artificial Neural Networks, (1992), pp. 109\u2013112."},{"key":"324840_CR18","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelat, Jr., C. D., and Vecchi, M. P.: Optimization by simulated annealing. Science, 220 (1983), 671\u2013680.","journal-title":"Science"},{"key":"324840_CR19","volume-title":"Perceptrons","author":"M. L. Minsky","year":"1969","unstructured":"Minsky, M. L. and Papert, S. A.: Perceptrons. MIT Press, Cambridge, Massachusetts, 1969."},{"issue":"3","key":"324840_CR20","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/BF01759049","volume":"6","author":"F. Romeo","year":"1991","unstructured":"Romeo F. and Sangiovanni-Vincentelli, A.: A theoretical framework for simulated annealing. Algorithmica, 6(3) (1991), 302\u2013345.","journal-title":"Algorithmica"},{"key":"324840_CR21","volume-title":"Principles of Neurodynamics","author":"F. Rosenblatt","year":"1962","unstructured":"Rosenblatt, F.: Principles of Neurodynamics. Spartan Books, New York, 1962."},{"issue":"2","key":"324840_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1022602303196","volume":"6","author":"J. Shavlik","year":"1991","unstructured":"Shavlik, J., Mooney, R. J., and Towell, G.: Symbolic and neural learning programs: an experimental comparison. Machine Learning, 6(2) (1991), 111\u2013143.","journal-title":"Machine Learning"},{"key":"324840_CR23","first-page":"476","volume":"169","author":"G. Temple","year":"1939","unstructured":"Temple, G.: The general theory of relaxations applied to linear systems. Proc. Roy. Soc. London, 169 (1939), 476\u2013500.","journal-title":"Proc. Roy. Soc. London"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011369322571.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011369322571\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011369322571.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T09:18:17Z","timestamp":1749719897000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011369322571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["324840"],"URL":"https:\/\/doi.org\/10.1023\/a:1011369322571","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"type":"print","value":"1370-4621"},{"type":"electronic","value":"1573-773X"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}