Sciweavers

1257 search results - page 208 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
FOCS
1997
IEEE
15 years 2 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
SAC
2008
ACM
14 years 9 months ago
Towards a model-driven engineering approach for developing embedded hard real-time software
Model-Driven Engineering (MDE) has been advocated as an effective way to deal with today's software complexity. MDE can be seen as an integrative approach combining existing ...
Fabiano Cruz, Raimundo S. Barreto, Lucas Cordeiro
INFOCOM
2008
IEEE
15 years 4 months ago
Wireless Medium Access via Adaptive Backoff: Delay and Loss Minimization
— We consider packet transmission scheduling at the MAC-layer via adaptive backoff algorithms that are favorable in terms of queue occupancies in a wireless network. General netw...
Gardar Hauksson, Murat Alanyali
ANOR
2010
112views more  ANOR 2010»
14 years 8 months ago
Online stochastic optimization under time constraints
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Pascal Van Hentenryck, Russell Bent, Eli Upfal
INFOCOM
2009
IEEE
15 years 4 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...