Computational Thinking - CMU School of Computer Science
https://www.cs.cmu.edu/~15110-s13/Wing06-ct.pdf
Computational human or by a machine. Computational methods and models give us the courage to solve prob-lems and design systems that no one of us would be cap ble of tackling alone. Computational think-ing confronts the riddle of machine intelligence: What can humans do better than computers? and What can computers
AFIPS Press, Reston, Va., 1967, pp. 483–485. 2. Benner, R.E., Gustafson, J.L., and Montry, G.R., Development and analysis of scientific application programs on a 1024-processor hypercube,” SAND 88-0317, Sandia National Laboratories, Feb. 1988. Communications of the ACM May 1088 Volume 31 Number 5 Created Date Mon, 30 Oct, 1995
Scheduling Algorithms for Multiprogramming in a Hard- Real-Time...
https://www.cs.ru.nl/~hooman/DES/liu-layland.pdf
(C,/T1) + (CJT~) +... + (C,~/T,~) > 1, there is clearly nofeasible scheduling a gorithm. To show the sufficiency, assume that the condition (C,/T,) + (CJT2) +... + (C~/T~) ~ 1 Journal of the Assoclatlon for Computing Machinery , Vol . 20, No. I, January 1973
Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee.
A Method for Obtaining Digital Signatures and Public-Key...
https://people.csail.mit.edu/rivest/Rsapaper.pdf
Since no techniques exist to prove that an encryption scheme is secure, the only test available is to see whether anyone can think of a way to break it. The NBS standard was "certified" this way; seventeen man-years at IBM were spent fruitlessly trying to break that scheme.
2019 HRS expert consensus statement on evaluation, risk...
The writing committee reviewed evidence gathered by electronic literature searches (MEDLINE/PubMed, Em- base, Cochrane Library). No specific year was chosen for the oldest literature.
Survey of Hallucination in Natural Language Generation
https://dl.acm.org/doi/epdf/10.1145/3571730
Here, the IE model is identifying and extracting the “facts” that require verification. In this way, words con-taining no verifiable information (stopwords, conjunctions, etc.) are not included in the verification step.
erly c 02139. This research wasupported by heOffice ofNaval Research under contract no. N00014-76-C-0366. @1979 ACM 0001-0782/79/1100-0612 $00.75. kk and n parameters we can give any sufficiently large majority theauthority to take some action while giving a sufficiently y large minority thepower toblock it. 612 Communications of