2421 search results - page 171 / 485 » Approximate Flow-Aware Networking |
125
click to vote
TNN
1998
15 years 3 months ago
1998
In this paper we regard first the situation where parallel channels are disturbed by noise. With the goal of maximal information conservation we deduce the conditions for a transf...
152
Voted
TRANSCI
2010
15 years 1 months ago
2010
To design a transportation sensor network, the decision-maker needs to determine what sensor investments should be made, as well as when, how, where and with what technologies. Th...
147
Voted
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
118
Voted
NCA
2010
IEEE
14 years 10 months ago
2010
IEEE
Programmability is an increasingly important barrier to the deployment of multi-robot systems, as no prior approach allows routine composition and reuse of general aggregate behavi...
117
click to vote
MMB
2004
Springer
15 years 8 months ago
2004
Springer
In the paper we present approaches to calculate single connections availability. Approximate calculations for the most representative protection topologies as well as for a partic...