5675 search results - page 873 / 1135 » Exploiting Chaos for Computation |
176
click to vote
FPL
1998
Springer
15 years 11 months ago
1998
Springer
The readily available performance advantages, gained in early virtual circuitry systems, are being recouped following advances in general purpose processor architectures and have ...
196
click to vote
MICRO
1996
IEEE
15 years 11 months ago
1996
IEEE
For decades, the serialization constraints imposed by true data dependences have been regarded as an absolute limit--the dataflow limit--on the parallel execution of serial progra...
181
click to vote
APN
1993
Springer
15 years 11 months ago
1993
Springer
This paper introduces an efficient numerical algorithm for transient analysis of deterministic and stochastic Petri nets (DSPNs) and other discrete-event stochastic systems with ...
219
click to vote
COLT
1993
Springer
15 years 11 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
241
click to vote
POPL
1993
ACM
15 years 11 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...