By Topic

A system-level analysis of robustness by randomised algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
C. Alippi ; Dipt. di Elettronica e Inf., Politecnico di Milano, Italy

Provides a methodology for analysing the robustness of a computational flow at a system level. Implementation issues, such as finite precision representation and fluctuations of the production parameters, can be studied directly at system level, independently from any technological aspect and quantisation technique. Only the behavioural descriptions of the computational flow and the architecture to be investigated are needed. The suggested analysis is based on the recently introduced theory of randomised algorithms, which transform the computationally intractable problem associated with the robustness investigation in a poly-time algorithm by resorting to probability

Published in:

Electronics, Circuits and Systems, 2001. ICECS 2001. The 8th IEEE International Conference on  (Volume:2 )

Date of Conference:

2001