Sciweavers

4190 search results - page 143 / 838
» The Cost of Design
Sort
View
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 8 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
172
Voted
COMCOM
2008
143views more  COMCOM 2008»
15 years 7 months ago
Cross-layer rate control, medium access control and routing design in cooperative VANET
In this paper, we address the rate control, the Medium Access Control (MAC) and the routing problem for cooperative Vehicular Ad-Hoc Network (VANET) in the framework of cross-laye...
Liang Zhou, Baoyu Zheng, Benoit Geller, Anne Wei, ...
MOR
2007
149views more  MOR 2007»
15 years 6 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
NCA
2007
IEEE
15 years 6 months ago
Ensemble of hybrid neural network learning approaches for designing pharmaceutical drugs
Designing drugs is a current problem in the pharmaceutical research. By designing a drug we mean to choose some variables of drug formulation (inputs), for obtaining optimal charac...
Ajith Abraham, Crina Grosan, Stefan Tigan
P2P
2010
IEEE
135views Communications» more  P2P 2010»
15 years 5 months ago
QoE in Pull Based P2P-TV Systems: Overlay Topology Design Tradeoffs
Abstract—This paper presents a systematic performance analysis of pull P2P video streaming systems for live applications, providing guidelines for the design of the overlay topol...
R. Fortuna, Emilio Leonardi, Marco Mellia, Michela...