2366 search results - page 311 / 474 » Mapping time |
186
Voted
CORR
1998
Springer
15 years 3 months ago
1998
Springer
This paper presents a method for analyzing the survivability of distributed network systems and an example of its application. Survivability is the capability of a system to fulfi...
150
Voted
NN
2002
Springer
15 years 3 months ago
2002
Springer
The ability to grow extra nodes is a potentially useful facility for a self-organising neural network. A network that can add nodes into its map space can approximate the input sp...
121
Voted
GLVLSI
2003
IEEE
15 years 8 months ago
2003
IEEE
FPGAs, because of their re-programmability, are becoming very popular for creating and exchanging VLSI intellectual properties (IPs) in the reuse-based design paradigm. Existing w...
128
click to vote
ASPDAC
2009
ACM
15 years 10 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
144
Voted
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
— Pseudo-random number generators (PRNG) have been intensively used in many stochastic algorithms in artificial intelligence, computer graphics and other scientific computing. ...