Sciweavers

2714 search results - page 74 / 543
» Approximation Schemes for Scheduling
Sort
View
AAAI
1997
15 years 1 months ago
Effective Redundant Constraints for Online Scheduling
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
Lise Getoor, Greger Ottosson, Markus P. J. Fromher...
115
Voted
CDC
2010
IEEE
151views Control Systems» more  CDC 2010»
14 years 7 months ago
On the optimal solutions of the infinite-horizon linear sensor scheduling problem
This paper studies the infinite-horizon sensor scheduling problem for linear Gaussian processes with linear measurement functions. Several important properties of the optimal infin...
Wei Zhang, Michael P. Vitus, Jianghai Hu, Alessand...
112
Voted
SIGCOMM
2006
ACM
15 years 6 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
ICC
2007
IEEE
213views Communications» more  ICC 2007»
15 years 6 months ago
On the Achievable Throughput of MIMO Broadcast Channels with Finite Rate Feedback
Abstract— We consider multiuser scheduling with limited feedback of partial channel state information in MIMO broadcast channels. By using spatial multiplexing at the base statio...
Wei Zhang, Khaled Ben Letaief
ICPP
1998
IEEE
15 years 4 months ago
Response Time Analysis for Distributed Real-Time Systems with Bursty Job Arrivals
This paper presents a new schedulability analysis methodology for distributed hard real-time systems with bursty job arrivals. The schedulability is analyzed by comparing worst-ca...
Chengzhi Li, Riccardo Bettati, Wei Zhao