658 search results - page 66 / 132 » Lower bounds for sorting networks |
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
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...
TCOM
2011
13 years 2 months ago
2011
—To lower costs, WDM PONs may share the usage of wavelengths, transmitters, and receivers among ONUs, instead of dedicating the transmission between OLT and each ONU with one ind...
PODC
2006
ACM
14 years 1 months ago
2006
ACM
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
SIROCCO
2003
13 years 9 months ago
2003
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...