Sciweavers

1172 search results - page 89 / 235
» Using Small Screen Space More Efficiently
Sort
View
107
Voted
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
15 years 7 months ago
The dispersion metric and the CMA evolution strategy
An algorithm independent metric is introduced that measures the dispersion of a uniform random sample drawn from the top ranked percentiles of the search space. A low dispersion f...
Monte Lunacek, Darrell Whitley
108
Voted
DAC
2007
ACM
16 years 4 months ago
Fast Min-Cost Buffer Insertion under Process Variations
Process variation has become a critical problem in modern VLSI fabrication. In the presence of process variation, buffer insertion problem under performance constraints becomes mo...
Ruiming Chen, Hai Zhou
124
Voted
DISCO
1992
79views Hardware» more  DISCO 1992»
15 years 7 months ago
REDUCE Meets CAMAL
It is generally accepted that special purpose algebraic systems are more efficient than general purpose ones, but as machines get faster this does not matter. An experiment has be...
John Fitch
158
Voted
MICRO
2003
IEEE
128views Hardware» more  MICRO 2003»
15 years 8 months ago
IPStash: a Power-Efficient Memory Architecture for IP-lookup
Abstract—High-speed routers often use commodity, fully-associative, TCAMs (Ternary Content Addressable Memories) to perform packet classification and routing (IP lookup). We prop...
Stefanos Kaxiras, Georgios Keramidas
145
Voted
PLDI
2010
ACM
16 years 1 months ago
Breadcrumbs: Efficient Context Sensitivity for Dynamic Bug Detection Analyses
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
Michael D. Bond, Graham Z. Baker, Samuel Z. Guyer