4719 search results - page 820 / 944 » Newtonian program analysis |
157
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
108
click to vote
ICPP
1999
IEEE
15 years 8 months ago
1999
IEEE
Trace-level reuse is based on the observation that some traces (dynamic sequences of instructions) are frequently repeated during the execution of a program, and in many cases, th...
132
click to vote
COLT
1999
Springer
15 years 8 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
152
click to vote
ISPAN
1999
IEEE
15 years 8 months ago
1999
IEEE
Parallel simulationhas the potentialto accelerate the execution of simulation applications. However, developing a parallel discrete-event simulation from scratch requires an in-de...
140
click to vote
KBSE
1999
IEEE
15 years 8 months ago
1999
IEEE
Refactorings are behavior-preserving program transformations that automate design evolution in object-oriented applications. Three kinds of design evolution are: schema transformat...