Sciweavers

5055 search results - page 704 / 1011
» Relative Timing
Sort
View
PLDI
1998
ACM
15 years 11 months ago
Improving Performance by Branch Reordering
The conditional branch has long been considered an expensive operation. The relative cost of conditional branches has increased as recently designed machines are now relying on de...
Minghui Yang, Gang-Ryung Uh, David B. Whalley
FPGA
1998
ACM
176views FPGA» more  FPGA 1998»
15 years 11 months ago
A Fast Routability-Driven Router for FPGAs
Three factors are driving the demand for rapid FPGA compilation. First, as FPGAs have grown in logic capacity, the compile computation has grown more quickly than the compute powe...
Jordan S. Swartz, Vaughn Betz, Jonathan Rose
IH
1998
Springer
15 years 11 months ago
Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System
Abstract. Currently knownbasic anonymitytechniques dependon identity veri cation. If veri cation of user identities is not possible due to the related management overhead or a gene...
Dogan Kesdogan, Jan Egner, Roland Büschkes
EUROMICRO
1997
IEEE
15 years 11 months ago
What's ahead in computer design?
CMOS technology should, over the next few years, reach lithography of under 0.1¡ . This provides a die area improvement of a factor of 10 over today’s technology. What is the b...
Michael J. Flynn
JELIA
1998
Springer
15 years 11 months ago
Towards State Update Axioms: Reifying Successor State Axioms
Successor state axioms are an optimal solution to the famous Frame Problem in reasoning about actions--but only as far as its representational aspect is concerned. We show how by g...
Michael Thielscher