4679 search results - page 562 / 936 » The Timely Computing Base Model and Architecture |
190
click to vote
QEST
2010
IEEE
15 years 4 months ago
2010
IEEE
Traditional architecture design approaches hide hardware uncertainties from the software stack through overdesign, which is often expensive in terms of power consumption. The recen...
199
click to vote
TAAS
2008
15 years 6 months ago
2008
Dynamic capacity provisioning is a useful technique for handling the multi-time-scale variations seen in Internet workloads. In this paper, we propose a novel dynamic provisioning...
198
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
If parallelism can be successfully exploited in a program, significant reductions in execution time can be achieved. However, if sections of the code are dominated by parallel ove...
205
click to vote
CSC
2009
15 years 7 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
228
click to vote
NIPS
1994
15 years 8 months ago
1994
Deformable models are an attractive approach to recognizing nonrigid objects which have considerable within class variability. However, there are severe search problems associated...