Sciweavers

3172 search results - page 146 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
IEEEPACT
2003
IEEE
15 years 11 months ago
Picking Statistically Valid and Early Simulation Points
Modern architecture research relies heavily on detailed pipeline simulation. Simulating the full execution of an industry standard benchmark can take weeks to months to complete. ...
Erez Perelman, Greg Hamerly, Brad Calder
WECWIS
2003
IEEE
125views ECommerce» more  WECWIS 2003»
15 years 11 months ago
A Non-Repudiation Message Transfer Protocol for E-commerce
In the business world, exchange of signatures or receipts is a common practice in case of future dispute. Likewise, it is critical in E-commerce applications to have the security ...
Seokwon Yang, Stanley Y. W. Su, Herman Lam
ISLPED
2003
ACM
91views Hardware» more  ISLPED 2003»
15 years 11 months ago
Reducing reorder buffer complexity through selective operand caching
Modern superscalar processors implement precise interrupts by using the Reorder Buffer (ROB). In some microarchitectures , such as the Intel P6, the ROB also serves as a repositor...
Gurhan Kucuk, Dmitry Ponomarev, Oguz Ergin, Kanad ...
UIST
2003
ACM
15 years 11 months ago
User interface continuations
Dialog boxes that collect parameters for commands often create ephemeral, unnatural interruptions of a program’s normal execution flow, encouraging the user to complete the dial...
Dennis Quan, David Huynh, David R. Karger, Robert ...
CP
2003
Springer
15 years 11 months ago
Terminating Decision Algorithms Optimally
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
Tuomas Sandholm