1753 search results - page 193 / 351 » Dynamic Scan Scheduling |
187
click to vote
TCAD
2010
14 years 10 months ago
2010
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
143
Voted
ORL
2000
15 years 3 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
147
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longra...
118
click to vote
ISCA
2002
IEEE
15 years 8 months ago
2002
IEEE
Leakage power is dominated by critical paths, and hence dynamic deactivation of fast transistors can yield large savings. We introduce metrics for comparing fine-grain dynamic de...
158
Voted
ATAL
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed senso...