154 search results - page 2 / 31 » Searching for Tight Performance Bounds in Feed-Forward Netwo... |
NCA
2005
IEEE
13 years 11 months ago
2005
IEEE
In this paper, fundamental conditions which bound the network processing unit (NPU) worst-case performance are established. In particular, these conditions formalize and integrate...
GLOBECOM
2006
IEEE
13 years 11 months ago
2006
IEEE
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...
ROBOCOMM
2007
IEEE
13 years 11 months ago
2007
IEEE
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
CNSR
2007
IEEE
13 years 7 months ago
2007
IEEE
Wireless sensor networks have mainly been designed for information-collecting purposes, such as habitat monitoring, product process tracing, battlefield surveillance, etc. In orde...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—We propose a non-coherent receiver for the fixed detect-and-forward relay channel and derive a closed-form tight upper bound on its bit error probability in Rayleigh fading cha...