1 research outputs found
Fast Winner-Takes-All Networks for the Maximum Clique Problem
We present an in-depth mathematical analysis of a winner-takes-all Network tailored to the maximum clique problem, a well-known intractable combinatorial optimization problem which has practical applications in several real world domains. The analysis yields tight bounds for the parameter settings to ensure energy descent to feasible solutions. To verify the theoretical..