Volume 106, Number 4, May 2014
|Number of page(s)||6|
|Published online||20 May 2014|
Robust optimization with transiently chaotic dynamical systems
Hungarian Physics Institute, Faculty of Physics, Babeş-Bolyai University - Mihail Kogălniceanu 1, 400084 Cluj-Napoca, Romania
Received: 29 January 2014
Accepted: 24 April 2014
Efficiently solving hard optimization problems has been a strong motivation for progress in analog computing. In a recent study we presented a continuous-time dynamical system for solving the NP-complete Boolean satisfiability (SAT) problem, with a one-to-one correspondence between its stable attractors and the SAT solutions. While physical implementations could offer great efficiency, the transiently chaotic dynamics raises the question of operability in the presence of noise, unavoidable on analog devices. Here we show that the probability of finding solutions is robust to noise intensities well above those present on real hardware. We also developed a cellular neural network model realizable with analog circuits, which tolerates even larger noise intensities. These methods represent an opportunity for robust and efficient physical implementations.
PACS: 05.45.-a – Nonlinear dynamics and chaos / 05.40.Ca – Noise / 89.20.Ff – Computer science and technology
© EPLA, 2014
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.