Abstract
The higher order connections network is useful to solve the combinatorial optimization problems, however, the network topology is complicated so that implementation on hardware is not easy. To implement the higher order connections more simply, we introduce the stochastic logic architecture to the discrete hysteresis network with the higher order connections. The proposed network can solve a Traveling Salesman Problems as the conventional network.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hayakawa, Y., Nakajima, K.: Design of the inverse function delayed neural network for solving combinatorial optimization problems. IEEE Trans. Neural Netw. 21(2), 224–237 (2010)
Sota, T., Hayakawa, Y., Sato, S., Nakajima, K.: An application of higher order connection to inverse function delayed network. Nonlinear Theory and Its Applications, IEICE 2(2), 180–197 (2011)
Kondo, Y., Sawada, Y.: Functional abilities of a stochastic logic nerual network. IEEE Trans. Neural Netw. 3(3), 434–443 (1992)
Sota, T., Hayakawa, Y., Sato, S., Nakajima, K.: Discrete higher order inverse function delayed network. In: Proc. NOLTA 2010, pp. 615–618 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sota, T., Hayakawa, Y., Sato, S., Nakajima, K. (2011). Method of Solving Combinatorial Optimization Problems with Stochastic Effects. In: Lu, BL., Zhang, L., Kwok, J. (eds) Neural Information Processing. ICONIP 2011. Lecture Notes in Computer Science, vol 7064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24965-5_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-24965-5_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24964-8
Online ISBN: 978-3-642-24965-5
eBook Packages: Computer ScienceComputer Science (R0)