Sciweavers

1414 search results - page 104 / 283
» Randomness and Universal Machines
Sort
View
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
14 years 1 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
AIED
2009
Springer
14 years 4 months ago
Detecting the Learning Value of Items In a Randomized Problem Set
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
Zachary A. Pardos, Neil T. Heffernan
TDSC
2010
119views more  TDSC 2010»
13 years 4 months ago
On the General Applicability of Instruction-Set Randomization
We describe Instruction-Set Randomization (ISR), a general approach for safeguarding systems against any type of code-injection attack. We apply Kerckhoffs' principle to creat...
Stephen W. Boyd, Gaurav S. Kc, Michael E. Locasto,...
CCS
2003
ACM
14 years 3 months ago
Countering code-injection attacks with instruction-set randomization
We describe a new, general approach for safeguarding systems against any type of code-injection attack. We apply Kerckhoff’s principle, by creating process-specific randomized ...
Gaurav S. Kc, Angelos D. Keromytis, Vassilis Preve...
EJC
2007
13 years 10 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...