Sciweavers

4303 search results - page 838 / 861
» Are We There Yet
Sort
View
118
Voted
OOPSLA
1997
Springer
15 years 4 months ago
Composite Design Patterns
ed Abstract Factory is yet another. When patterns cooperate, the cooperation itself can give rise to problems, contexts, trade-offs, and consequences. For instance, should a Visito...
Dirk Riehle
FSTTCS
1993
Springer
15 years 4 months ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell
PLDI
1994
ACM
15 years 4 months ago
Memory Access Coalescing: A technique for Eliminating Redundant memory Accesses
As microprocessor speeds increase, memory bandwidth is increasing y the performance bottleneck for microprocessors. This has occurred because innovation and technological improvem...
Jack W. Davidson, Sanjay Jinturkar
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 4 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
130
Voted
CGO
2007
IEEE
15 years 4 months ago
Shadow Profiling: Hiding Instrumentation Costs with Parallelism
In profiling, a tradeoff exists between information and overhead. For example, hardware-sampling profilers incur negligible overhead, but the information they collect is consequen...
Tipp Moseley, Alex Shye, Vijay Janapa Reddi, Dirk ...