Sciweavers

552 search results - page 97 / 111
» Lower bounds for dynamic connectivity
Sort
View
NETWORKS
2006
13 years 7 months ago
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith
TAPAS
2011
243views Algorithms» more  TAPAS 2011»
13 years 2 months ago
Speed Scaling for Energy and Performance with Instantaneous Parallelism
Abstract. We consider energy-performance tradeoff for scheduling parallel jobs on multiprocessors using dynamic speed scaling. The objective is to minimize the sum of energy consu...
Hongyang Sun, Yuxiong He, Wen-Jing Hsu
BMCBI
2007
172views more  BMCBI 2007»
13 years 7 months ago
Bayesian approaches to reverse engineer cellular systems: a simulation study on nonlinear Gaussian networks
Background: Reverse engineering cellular networks is currently one of the most challenging problems in systems biology. Dynamic Bayesian networks (DBNs) seem to be particularly su...
Fulvia Ferrazzi, Paola Sebastiani, Marco Ramoni, R...
ISCA
2003
IEEE
169views Hardware» more  ISCA 2003»
14 years 1 months ago
Virtual Simple Architecture (VISA): Exceeding the Complexity Limit in Safe Real-Time Systems
Meeting deadlines is a key requirement in safe realtime systems. Worst-case execution times (WCET) of tasks are needed for safe planning. Contemporary worst-case timing analysis t...
Aravindh Anantaraman, Kiran Seth, Kaustubh Patil, ...
MOBICOM
2005
ACM
14 years 1 months ago
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Next generation fixed wireless broadband networks are being increasingly deployed as mesh networks in order to provide and extend access to the internet. These networks are chara...
Murali S. Kodialam, Thyaga Nandagopal