Sciweavers

719 search results - page 129 / 144
» Adaptive Online Time Allocation to Search Algorithms
Sort
View
ICS
2010
Tsinghua U.
15 years 5 days ago
Clustering performance data efficiently at massive scales
Existing supercomputers have hundreds of thousands of processor cores, and future systems may have hundreds of millions. Developers need detailed performance measurements to tune ...
Todd Gamblin, Bronis R. de Supinski, Martin Schulz...
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
15 years 1 months ago
Overcoming hierarchical difficulty by hill-climbing the building block structure
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
David Iclanzan, Dan Dumitrescu
COMPUTER
2000
180views more  COMPUTER 2000»
14 years 9 months ago
The Challenges of Automatic Summarization
tion--the art of abstracting key content from one or more information sources--has become an integral part of everyday life. People keep abreast of world affairs by listening to ne...
Udo Hahn, Inderjeet Mani
CIKM
2009
Springer
15 years 4 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
DATE
2009
IEEE
171views Hardware» more  DATE 2009»
15 years 1 months ago
Physically clustered forward body biasing for variability compensation in nanometer CMOS design
Nanometer CMOS scaling has resulted in greatly increased circuit variability, with extremely adverse consequences on design predictability and yield. A number of recent works have...
Ashoka Visweswara Sathanur, Antonio Pullini, Luca ...