{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T10:57:10Z","timestamp":1648551430398},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1007\/bf01421961","type":"journal-article","created":{"date-parts":[[2005,4,11]],"date-time":"2005-04-11T16:19:56Z","timestamp":1113236396000},"page":"101-112","source":"Crossref","is-referenced-by-count":2,"title":["Discrete optimisation based on the combined use of reinforcement and constraint satisfaction schemes"],"prefix":"10.1007","volume":"3","author":[{"given":"A.","family":"Likas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Kontoravdis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Stafylopatis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Simulated Annealing and Boltzmann Machines, A Stochastic Approach to Combinatorial Optimisation and Neural Computing","author":"E Aarts","year":"1989","unstructured":"Aarts E, Korst J. Simulated Annealing and Boltzmann Machines, A Stochastic Approach to Combinatorial Optimisation and Neural Computing. John Wiley, Chichester, 1989"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","volume":"79","author":"J Hopfield","year":"1982","unstructured":"Hopfield J. Neural networks and physical systems with emergent collective computational abilities. In: Proc. National Academy of Sciences USA 1982; 79: 2554?2558","journal-title":"Proc. National Academy of Sciences USA"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gellat Jr. CD, Vecchi MP. Optimization by simulated annealing. Science 1983; 220: 671?689","journal-title":"Science"},{"key":"CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1997-9","volume-title":"A Connectionist Machine for Genetic Hillclimbing","author":"DH Ackley","year":"1987","unstructured":"Ackley DH. A Connectionist Machine for Genetic Hillclimbing. Kluwer, Norwell, MA, 1987"},{"key":"CR5","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989"},{"key":"CR6","unstructured":"Williams RJ. Toward a theory of reinforcement learning connectionist systems. Technical Report NU-CCS-88-3, Boston, MA, 1988"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1109\/IJCNN.1989.118683","volume":"II","author":"RJ Williams","year":"1989","unstructured":"Williams RJ, Peng J. Reinforcement learning algorithms as function optimizers. In: Proc. Int Joint Conf Neural Networks, vol II. Washington, DC, 1989, pp 89?95","journal-title":"Proc. Int Joint Conf Neural Networks"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1080\/09540099108946587","volume":"3","author":"RJ Williams","year":"1991","unstructured":"Williams RJ, Peng J. Function optimization using connectionist reinforcement learning networks. Connection Science 1991; 3: 241?268","journal-title":"Connection Science"},{"key":"CR9","first-page":"229","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams RJ. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learning 1992; 8: 229?256","journal-title":"Machine Learning"},{"issue":"6","key":"CR10","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1109\/72.165596","volume":"3","author":"Y Shrivastava","year":"1992","unstructured":"Shrivastava Y, Dasgupta S, Reddy SM, Guaranteed convergence in a class of Hopfield Networks. IEEE Trans Neural Networks 1992; 3(6): 951?961","journal-title":"IEEE Trans Neural Networks"},{"key":"CR11","first-page":"143","volume":"I","author":"D Kontoravdis","year":"1992","unstructured":"Kontoravdis D, Likas A, Stafylopatis A. A reinforcement learning algorithm for networks of units with two stochastic levels. In: Proc ICANN-92, vol I. Brighton, UK, 1992, pp 143?146","journal-title":"Proc ICANN-92"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Kontoravdis D, Likas A, Stafylopatis A. Enhancing stochasticity in reinforcement learning schemes: Application to the exploration of binary domains. Journal of Intelligent Systems (to appear)","DOI":"10.1515\/JISYS.1995.5.1.49"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/0893-6080(90)90056-Q","volume":"3","author":"V Gullapalli","year":"1990","unstructured":"Gullapalli V. A stochastic reinforcement learning algorithm for learning real-valued functions. Neural Networks 1990; 3: 671?692","journal-title":"Neural Networks"},{"key":"CR14","volume-title":"Computers and Intractability: a Guide to the Theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson D. Computers and Intractability: a Guide to the Theory of NP-completeness. W.H. Freeman and Company, San Francisco, 1979"}],"container-title":["Neural Computing & Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01421961.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01421961\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01421961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:27:52Z","timestamp":1556803672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01421961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF01421961"],"URL":"https:\/\/doi.org\/10.1007\/bf01421961","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}