Abstract
Presents an algorithm which realizes fast search for the solutions of combinatorial optimization problems with digital and parallel processors. By modifying the weight matrix, the proposed model avoids oscillation and realizes energy reduction under the synchronous discrete dynamics. As a result, the proposed model realizes quasi-optimum solutions with much fewer iterations than the existing models.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
