2681 search results - page 421 / 537 » Problem F |
NN
2000
Springer
13 years 10 months ago
2000
Springer
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
PPL
2000
13 years 10 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
COMBINATORICS
1998
13 years 10 months ago
1998
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
CJ
1999
13 years 9 months ago
1999
The ability to predict the directions of branches, especially conditional branches, is an important problem in modern computer architecture and advanced compilers. Many static and...
CL
1999
Springer
13 years 9 months ago
1999
Springer
It is well known that dynamic typing in languages like Lisp is costly in terms of performance. Besides the cost of tag checking, the other major source of ine ciency comes from th...