ABSTRACT
It is too early to say which of the approaches currently being investigated will lead to the best solution to the problem of measuring data processes. All have promising aspects, but a great deal more experience is needed to see how useful they are in practice.
- Hellerman, L. A measure of computational work. IEEE Trans on Computers, Vol. C-21, No. 5, May 1972, pp. 439--446. Google ScholarDigital Library
- Hellerman, L. A discussion of "a measure of computational work." IEEE Trans on Computers, Feb. 1974, pp. 208--211. Google ScholarDigital Library
- Hellerman, L. The power and efficiency of a computer system. Lecture Notes in Computer Science, Vol. 8, Springer-Verlag, 1974, pp. 190--205.Google ScholarDigital Library
Recommendations
Computational design of polyomino puzzles
AbstractPeople of all ages enjoy solving geometric puzzles. However, finding suitable puzzles, e.g., puzzles with a moderate level of difficulty or puzzles with intellectually stimulating shapes can be difficult. In addition, designing innovative and ...
Computational complexity of string puzzles
CATS '12: Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128A disentanglement puzzle consists of mechanically interlinked pieces, and the puzzle is solved by disentangling one piece from another set of pieces. A string puzzle is a type of disentanglement puzzle, which consists of strings entangled with one or ...
Comments