Sciweavers

75 search results - page 3 / 15
» Quality and Utility - Towards a Generalization of Deadline a...
Sort
View
AI
1998
Springer
13 years 4 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf
MDM
2009
Springer
138views Communications» more  MDM 2009»
13 years 11 months ago
SLA-Aware Adaptive On-demand Data Broadcasting in Wireless Environments
—In mobile and wireless networks, data broadcasting for popular data items enables the efficient utilization of the limited wireless bandwidth. However, efficient data scheduli...
Adrian Daniel Popescu, Mohamed A. Sharaf, Cristian...
DAC
2009
ACM
14 years 5 months ago
An adaptive scheduling and voltage/frequency selection algorithm for real-time energy harvesting systems
? In this paper we propose an adaptive scheduling and voltage/frequency selection algorithm which targets at energy harvesting systems. The proposed algorithm adjusts the processor...
Shaobo Liu, Qing Wu, Qinru Qiu
AAAI
2006
13 years 6 months ago
Anytime Induction of Decision Trees: An Iterative Improvement Approach
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
Saher Esmeir, Shaul Markovitch
PE
2006
Springer
95views Optimization» more  PE 2006»
13 years 4 months ago
Deterministic end-to-end delay guarantees with rate controlled EDF scheduling
Quality of Service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Earliest Deadline First (ED...
Vijay Sivaraman, Fabio M. Chiussi, Mario Gerla