Sciweavers

1095 search results - page 141 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
FCCM
2005
IEEE
139views VLSI» more  FCCM 2005»
15 years 3 months ago
A Study of the Scalability of On-Chip Routing for Just-in-Time FPGA Compilation
Just-in-time (JIT) compilation has been used in many applications to enable standard software binaries to execute on different underlying processor architectures. We previously in...
Roman L. Lysecky, Frank Vahid, Sheldon X.-D. Tan
AOR
2010
14 years 7 months ago
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
Brian C. Dean
SAMOS
2007
Springer
15 years 4 months ago
An Evolutionary Approach to Area-Time Optimization of FPGA designs
—This paper presents a new methodology based on evolutionary multi-objective optimization (EMO) to synthesize multiple complex modules on programmable devices (FPGAs). It starts ...
Fabrizio Ferrandi, Pier Luca Lanzi, Gianluca Paler...
ECRTS
2009
IEEE
14 years 7 months ago
Hierarchical Utilization Control for Real-Time and Resilient Power Grid
Blackouts in our daily life can be disastrous with enormous economic loss. Blackouts usually occur when appropriate corrective actions are not effectively taken for an initial con...
Ming Chen, Clinton Nolan, Xiaorui Wang, Sarina Adh...
ICCV
2009
IEEE
14 years 7 months ago
Exploiting uncertainty in random sample consensus
In this work, we present a technique for robust estimation, which by explicitly incorporating the inherent uncertainty of the estimation procedure, results in a more efficient rob...
Rahul Raguram, Jan-Michael Frahm, Marc Pollefeys