Sciweavers

5005 search results - page 724 / 1001
» The Design and Analysis of Parallel Algorithms
Sort
View
IEEEPACT
2003
IEEE
15 years 12 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
ASPLOS
1992
ACM
15 years 10 months ago
Efficient Superscalar Performance Through Boosting
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
Michael D. Smith, Mark Horowitz, Monica S. Lam
SIGMETRICS
2008
ACM
159views Hardware» more  SIGMETRICS 2008»
15 years 6 months ago
Weighted fair sharing for dynamic virtual clusters
In a shared server infrastructure, a scheduler controls how quantities of resources are shared over time in a fair manner across multiple, competing consumers. It should support w...
Laura E. Grit, Jeffrey S. Chase
TEC
2002
128views more  TEC 2002»
15 years 6 months ago
A framework for evolutionary optimization with approximate fitness functions
It is not unusual that an approximate model is needed for fitness evaluation in evolutionary computation. In this case, the convergence properties of the evolutionary algorithm are...
Yaochu Jin, Markus Olhofer, Bernhard Sendhoff
TIST
2011
136views more  TIST 2011»
15 years 1 months ago
Probabilistic models for concurrent chatting activity recognition
Recognition of chatting activities in social interactions is useful for constructing human social networks. However, the existence of multiple people involved in multiple dialogue...
Jane Yung-jen Hsu, Chia-chun Lian, Wan-rong Jih