Hsu, Tsong-ChihTsong-ChihHsuSHENG-DE WANG2020-06-042020-06-041997https://scholars.lib.ntu.edu.tw/handle/123456789/497319In this article we present a k-winners-take-all (k-WTA) neural net that is established based on the concept of the constant time sorting machine by Hsu and Wang. It fits some specific applications, such as real-time processing, since its Theta(1) time complexity is independent to the problem size. The proposed k-WTA neural net produces the solution in constant time while the Hopfield network requires a relatively long transient to converge to the solution from some initial states.journal article10.1109/72.641477https://doi.org/10.1109/72.641477