Sciweavers

914 search results - page 89 / 183
» Branch and Bound on the Network Model
Sort
View
INFOCOM
2003
IEEE
15 years 3 months ago
Network Management Information For Light-Path Assessment: Trade-off between Performance and Complexity
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
Guanglei Liu, Chuanyi Ji, Vincent W. S. Chan
ECRTS
2002
IEEE
15 years 2 months ago
Weakly Hard Real-time Constraints on Controller Area Network
For priority based buses such as CAN, worst case response time analysis is able to determine whether messages always meet their deadlines. This can include system models with boun...
Ian Broster, Guillem Bernat, Alan Burns
CORR
2007
Springer
126views Education» more  CORR 2007»
14 years 9 months ago
Interference and Outage in Clustered Wireless Ad Hoc Networks
—In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, th...
Radha Krishna Ganti, Martin Haenggi
IPL
2010
112views more  IPL 2010»
14 years 8 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
14 years 4 months ago
Stability analysis of networked control systems: A sum of squares approach
This paper presents a sum of squares (SOS) approach to the stability analysis of networked control systems (NCSs) incorporating time-varying delays and time-varying transmission in...
Nicolas William Bauer, Paul J. H. Maas, W. P. M. H...