Sciweavers

2714 search results - page 98 / 543
» Approximation Schemes for Scheduling
Sort
View
81
Voted
IPL
2008
95views more  IPL 2008»
15 years 18 days ago
The Generalized Maximum Coverage Problem
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in w...
Reuven Cohen, Liran Katzir
ISCC
2009
IEEE
163views Communications» more  ISCC 2009»
15 years 7 months ago
Distributed parallel scheduling algorithms for high-speed virtual output queuing switches
Abstract—This paper presents a novel scalable switching architecture for input queued switches with its proper arbitration algorithms. In contrast to traditional switching archit...
Lotfi Mhamdi, Mounir Hamdi
134
Voted
INFOCOM
1995
IEEE
15 years 4 months ago
Computing Approximate Blocking Probabilities for a Class of All-Optical Networks
W e study a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a ...
Alexander Birman
85
Voted
JIRS
2006
87views more  JIRS 2006»
15 years 17 days ago
A Comparison of Fuzzy and CPWL Approximations in the Continuous-time Nonlinear Model-predictive Control of Time-delayed Wiener-t
This paper deals with a novel method of continuous-time model-predictive control for nonlinear time-delayed systems. The problems relating to time delays are solved by incorporatin...
Simon Oblak, Igor Skrjanc
91
Voted
CORR
2008
Springer
127views Education» more  CORR 2008»
15 years 21 days ago
A Very Efficient Scheme for Estimating Entropy of Data Streams Using Compressed Counting
Compressed Counting (CC) was recently proposed for approximating the th frequency moments of data streams, for 0 < 2. Under the relaxed strict-Turnstile model, CC dramaticall...
Ping Li