Sciweavers

806 search results - page 142 / 162
» Lower Bounds on Correction Networks
Sort
View
INFOCOM
2009
IEEE
14 years 5 months ago
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach
—A major problem in wireless networks is coping with limited resources, such as bandwidth and energy. These issues become a major algorithmic challenge in view of the dynamic nat...
Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, ...
DAC
2000
ACM
14 years 11 months ago
On switch factor based analysis of coupled RC interconnects
We revisit a basic element of modern signal integrity analysis, the modeling of worst-case coupling capacitance effects within a switch factor (SF) based methodology. We show that...
Andrew B. Kahng, Sudhakar Muddu, Egino Sarto
ICAC
2007
IEEE
14 years 4 months ago
Autonomic Reactive Systems via Online Learning
— Reactive systems are those that maintain an ongoing interaction with their environment at a speed dictated by the latter. Examples of such systems include web servers, network ...
Sanjit A. Seshia
INFOCOM
2000
IEEE
14 years 2 months ago
Admission Control Based on End-to-End Measurements
— This paper proposes a controlled-load service that provides a network state with bounded and well known worst-case behavior. The service is primarily developed for real-time ap...
Viktória Elek, Gunnar Karlsson, Robert R&ou...
INFOCOM
2010
IEEE
13 years 8 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...