3934 search results - page 483 / 787 » Approximate Schedulability Analysis |
226
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
176
click to vote
ADC
2007
Springer
16 years 27 days ago
2007
Springer
Histograms are used extensively for selectivity estimation and approximate query processing. Workloadaware dynamic histograms can self-tune itself based on query feedback without ...
179
click to vote
CP
2004
Springer
16 years 3 days ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
155
click to vote
IPPS
2003
IEEE
16 years 28 min ago
2003
IEEE
Advances across many fields of study are driving changes in the basic nature of scientific computing applications. Scientists have recognized a growing need to study phenomena b...
170
click to vote
RTSS
2002
IEEE
15 years 11 months ago
2002
IEEE
Typical real-time scheduling theory has addressed deadline and energy constraints as well as deadline and reward constraints simultaneously in the past. However, we believe that e...