Sciweavers

1738 search results - page 192 / 348
» An algorithmic framework for network reconstruction
Sort
View
INFOCOM
2008
IEEE
16 years 27 days ago
Utility Max-Min Fair Congestion Control with Time-Varying Delays
Abstract—We present a framework for designing delayindependent end-to-end congestion control algorithms, where each end-user may have a different utility function. We only requir...
Konstantin Miller, Tobias Harks
SIGMETRICS
2002
ACM
118views Hardware» more  SIGMETRICS 2002»
15 years 6 months ago
Robust traffic engineering: game theoretic perspective
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...
Vladimir Marbukh
FOCS
1993
IEEE
15 years 10 months ago
Throughput-Competitive On-Line Routing
We develop a framework that allows us to address the issues of admission control and routing in high-speed networks under the restriction that once a call is admitted and routed, ...
Baruch Awerbuch, Yossi Azar, Serge A. Plotkin
IPSN
2010
Springer
16 years 1 months ago
Distributed genetic evolution in WSN
Wireless Sensor Actuator Networks (WSANs) extend wireless sensor networks through actuation capability. Designing robust logic for WSANs however is challenging since nodes can aï¬...
Philip Valencia, Peter Lindsay, Raja Jurdak
BIOINFORMATICS
2006
142views more  BIOINFORMATICS 2006»
15 years 6 months ago
Intervention in a family of Boolean networks
Motivation: Intervention in a gene regulatory network is used to avoid undesirable states, such as those associated with a disease. Several types of intervention have been studied...
Ashish Choudhary, Aniruddha Datta, Michael L. Bitt...