Sustaining Moore’s Law in Embedded Computing through Probabilistic and Approximate Design: Retrospects and Prospects Krishna V. Palem Lakshmi N.B. Chakrapani

First Page		Document Content
Date: 2012-08-15 22:20:27 Electronic design Probabilistic complexity theory Digital electronics Integrated circuits Logic families Krishna Palem Randomized algorithm PP Probabilistic logic Theoretical computer science Electronic engineering Computational complexity theory		Sustaining Moore’s Law in Embedded Computing through Probabilistic and Approximate Design: Retrospects and Prospects Krishna V. Palem Lakshmi N.B. Chakrapani Add to Reading List Source URL: www.ece.rice.edu Download Document from Source Website File Size: 577,19 KB Share Document on Facebook

	Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014 DocID: 1rrqu - View Document
	Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing. DocID: 1rgOi - View Document
	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti DocID: 1rgbF - View Document
	Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN By DocID: 1rdMz - View Document
	Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995 DocID: 1raDV - View Document