36 search results - page 3 / 8 » Computational Complexity of Weighted Threshold Games |
NCA
2006
IEEE
13 years 5 months ago
2006
IEEE
The use of multilayer perceptrons (MLP) with threshold functions (binary step function activations) greatly reduces the complexity of the hardware implementation of neural networks...
SOFSEM
2009
Springer
14 years 2 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
FSTTCS
2010
Springer
13 years 3 months ago
2010
Springer
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objectiv...
ECCC
2000
13 years 5 months ago
2000
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
TSMC
2008
13 years 5 months ago
2008
A novel thresholding algorithm is presented in this paper to improve image segmentation performance at a low computational cost. The proposed algorithm uses a normalized graphcut m...