9716 search results - page 158 / 1944 » The Case for Energy-Proportional Computing |
184
click to vote
COCO
2005
Springer
16 years 2 days ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
216
click to vote
LCTRTS
2000
Springer
15 years 10 months ago
2000
Springer
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
167
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
187
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
The paper describes a simple but robust framework for visual object tracking in a video sequence. Compared with the existing tracking techniques, our proposed tracking technique h...
278
click to vote
GIS
2008
ACM
16 years 7 months ago
2008
ACM
Given a spatial crime data warehouse, that is updated infrequently and a set of operations O as well as constraints of storage and update overheads, the index type selection probl...