z-logo
open-access-imgOpen Access
A Note on Mapping a Matching Problem to a Majority Network as a Lyapunov Function: Problem Solving by Synchronization
Author(s) -
Yoshiteru Ishida,
Yu-Ichiro Yamanaka
Publication year - 2014
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2014.08.181
Subject(s) - computer science , lyapunov function , convergence (economics) , synchronization (alternating current) , function (biology) , mathematical optimization , matching (statistics) , process (computing) , lyapunov stability , mathematics , nonlinear system , artificial intelligence , computer network , channel (broadcasting) , statistics , physics , quantum mechanics , evolutionary biology , economics , biology , economic growth , operating system , control (management)
This note proposes a symmetric majority network as an energy function in discrete problem solving. As in the Lyapunov function in non-linear dynamical systems, the energy function can show convergence on stable fixed points. Similarly, the symmetric majority network, when mapped properly, can show convergence on the solution. The state transition process to the solution can also indicate a problem-solving process. As an example of discrete problem solving, a matching problem is adopted and the problem-solving process will be visualized by a simulation of a mapped majority network. The stable marriage problem, size 3 and size 4 in part, is considered and the majority network is extended to solve it

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom