1017 search results - page 121 / 204 » Register computations on ordinals |
PLDI
2003
ACM
14 years 1 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
LCPC
2009
Springer
14 years 12 days ago
2009
Springer
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
IPPS
1998
IEEE
14 years 2 days ago
1998
IEEE
We consider the problem of location management of mobile users. The objective is to keep track of the mobile users in order to deliver calls. The IS-41 is a simple strategy for loc...
CVRMED
1997
Springer
13 years 12 months ago
1997
Springer
The majority of the available rigid registration measures are based on a 2-dimensional histogram of corresponding grey-values in the registered images. This paper shows that these ...
EUROPAR
1997
Springer
13 years 12 months ago
1997
Springer
Instruction scheduling in general, and software pipelining in particular face the di cult task of scheduling operations in the presence of uncertain latencies. The largest contrib...