Sciweavers

2107 search results - page 148 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
239
Voted
ICS
2007
Tsinghua U.
15 years 9 months ago
Scheduling FFT computation on SMP and multicore systems
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok
134
Voted
SIROCCO
2000
15 years 5 months ago
On time versus size for monotone dynamic monopolies in regular topologies
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
Paola Flocchini, Rastislav Kralovic, Alessandro Ro...
113
Voted
ICCAD
2002
IEEE
107views Hardware» more  ICCAD 2002»
16 years 15 days ago
Characteristic faults and spectral information for logic BIST
We present a new method of built-in-self-test (BIST) for sequential circuits and system-on-a-chip (SOC) using characteristic faults and circuitspecific spectral information in th...
Xiaoding Chen, Michael S. Hsiao
135
Voted
GECCO
2010
Springer
230views Optimization» more  GECCO 2010»
15 years 8 months ago
Exponential natural evolution strategies
The family of natural evolution strategies (NES) offers a principled approach to real-valued evolutionary optimization by following the natural gradient of the expected fitness....
Tobias Glasmachers, Tom Schaul, Yi Sun, Daan Wiers...
137
Voted
RTCSA
2009
IEEE
15 years 10 months ago
Managing Imprecise Worst Case Execution Times on DVFS Platforms
Abstract—Although energy-efficient real-time task scheduling has attracted a lot of attention in the past decade, most existing results assumed deterministic execution lengths f...
Vandy Berten, Chi-Ju Chang, Tei-Wei Kuo