Publication | Closed Access
Winner-take-all networks: Time-based versus activation-based mechanisms for various selection goals
10
Citations
4
References
2002
Year
Unknown Venue
EngineeringGame TheoryNetwork AnalysisComputational ComplexityWinner-take-all NetworksDiscrete-event SimulationComplexityNetwork DynamicUnit RecruitmentNetwork EvolutionNetwork CalculusSystems EngineeringDecision TheoryConventional WtaMechanism DesignSocial Network AnalysisCognitive ScienceBehavioral SciencesNetwork FlowsEconomics Of NetworkSpace ComplexityScheduling (Computing)Computer ScienceNetwork TheoryNetwork ScienceBusinessTemporal NetworkResource Optimization
A time-based temporal-winner-take-all (TWTA) mechanism, with O(n) space complexity and roughly O(log n) time complexity is presented. It exploits systematic and stochastic differences between time delays within different units and connections. TWTA is logically equivalent to standard winner-take-all (WTA), but TWTA may be more suitable for various selection tasks, especially the selection of an arbitrary unit from a set (e.g. as in unit recruitment). TWTA avoids various problems with conventional WTA, notably the difficulty of making it converge rapidly over a large range of conditions. A mathematical analysis of the mechanism and simulations of it are reported. TWTA and WTA are compared and discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
| Year | Citations | |
|---|---|---|
Page 1
Page 1