7200 search results - page 24 / 1440 » On the Computational Power of Winner-Take-All |
ISCAS
2007
IEEE
14 years 2 months ago
2007
IEEE
— We propose a computationally efficient method based on nonlinear optimization to identify critical lines, failure of which can cause severe blackouts. Our method computes crit...
ITNG
2007
IEEE
14 years 2 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
TCS
2010
13 years 7 months ago
2010
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
ISCA
2011
IEEE
13 years 11 days ago
2011
IEEE
Much of the success of the Internet services model can be attributed to the popularity of a class of workloads that we call Online Data-Intensive (OLDI) services. These workloads ...
COLT
1992
Springer
14 years 23 days ago
1992
Springer
This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal&q...