Sciweavers

471 search results - page 52 / 95
» Faster Multiplication in GF(2)[x]
Sort
View
ISCA
2002
IEEE
103views Hardware» more  ISCA 2002»
14 years 2 months ago
Efficient Dynamic Scheduling Through Tag Elimination
An increasingly large portion of scheduler latency is derived from the monolithic content addressable memory (CAM) arrays accessed during instruction wakeup. The performance of th...
Dan Ernst, Todd M. Austin
INFOCOM
1999
IEEE
14 years 2 months ago
A Time-Scale Decomposition Approach to Measurement-Based Admission Control
We propose a time-scale decomposition approach to measurement-based admission control (MBAC). We identify a critical time scale such that: 1) aggregate traffic fluctuation slower t...
Matthias Grossglauser, David N. C. Tse
CORR
2002
Springer
111views Education» more  CORR 2002»
13 years 9 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
CSCW
2002
ACM
13 years 9 months ago
The use of visual information in shared visual spaces: informing the development of virtual co-presence
A shared visual workspace is one where multiple people can see the same objects at roughly the same time. We present findings from an experiment investigating the effects of share...
Robert E. Kraut, Darren Gergle, Susan R. Fussell
SIAMAM
2000
131views more  SIAMAM 2000»
13 years 9 months ago
The Description of Homogeneous Branched-Chain Explosions with Slow Radical Recombination by Self-Adjusting Time Scales
A nonlinear multiscale technique is used to describe the time history of a spatially homogeneous chain-branching/chain-breaking explosion when chain branching is much faster than c...
Antonio L. Sanchez, Luis L. Bonilla, Manuel Carret...