Sciweavers

2714 search results - page 77 / 543
» Approximation Schemes for Scheduling
Sort
View
99
Voted
GLOBECOM
2009
IEEE
14 years 10 months ago
Maintaining Utility Fairness Using Weighting Factors in Wireless Networks
Maintaining fairness using weighting factors is a common approach in resource allocation. However, computing weighting factors for multiservice wireless networks is not trivial bec...
Mehri Mehrjoo, Mohamad Khattar Awad, Mehrdad Diana...
ICML
1998
IEEE
16 years 1 months ago
Value Function Based Production Scheduling
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...
Jeff G. Schneider, Justin A. Boyan, Andrew W. Moor...
BROADNETS
2007
IEEE
15 years 7 months ago
Scheduling routing table calculations to achieve fast convergence in OSPF protocol
Fast convergence to topology changes is a key requirement in modern routing infrastructure while reducing the protocol CPU overhead continues to be as important as before. In this...
Mukul Goyal, Weigao Xie, Mohd Soperi, Seyed H. Hos...
ICML
2000
IEEE
16 years 1 months ago
Rates of Convergence for Variable Resolution Schemes in Optimal Control
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
Andrew W. Moore, Rémi Munos
AAAI
2007
15 years 2 months ago
Approximate Counting by Sampling the Backtrack-free Search Space
We present a new estimator for counting the number of solutions of a Boolean satisfiability problem as a part of an importance sampling framework. The estimator uses the recently...
Vibhav Gogate, Rina Dechter