Sciweavers

2652 search results - page 61 / 531
» Optimal design in collaborative design network
Sort
View
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 7 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
ICN
2001
Springer
15 years 10 months ago
Backbone Network Design with QoS Requirements
In this paper, we consider the backbone network design problem with a full set of QoS requirements. Unlike previous researches, we consider both the transmission line cost and the ...
Hong-Hsu Yen, Frank Yeong-Sung Lin
MTA
2007
70views more  MTA 2007»
15 years 5 months ago
Tools for transparent synchronous collaborative environments
Synchronous collaborative environments can provide an identical visual and operable working area among geographically separated participants. There are two basic approaches for pro...
Abdulmotaleb El-Saddik, Dongsheng Yang, Nicolas D....
DSD
2006
IEEE
131views Hardware» more  DSD 2006»
15 years 9 months ago
Designing Efficient Irregular Networks for Heterogeneous Systems-on-Chip
Abstract-- Networks-on-Chip will serve as the central integration platform in future complex SoC designs, composed of a large number of heterogeneous processing resources. Most res...
Christian Neeb, Norbert Wehn
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
16 years 20 days ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd