researchr - search publication broadcast networks

researchr

You are not signed in
Sign in
Sign up

2207 publication results matching 'broadcast networks'

Degree- and time-constrained broadcast networks
… as possible, subject to upper bounds on the degree and broadcast time. This paper … graphs using a stochastic search algorithm to approximate the broadcast time. Significant improvements on known results are obtained for cubic broadcast …
Michael J. Dinneen, Geoffrey Pritchard, Mark C. Wilson. networks, 39(3):121-129, 2002. [doi]
Construction of Time Relaxed Minimal Broadcast Networks
… node of the network must be transmitted to all the other nodes. A minimal broadcast network is a communication network that can transmit a message … broadcast networks ($t$-mbn), in which broadcasting can be accomplished in slightly …
Michael J. Dinneen, Jose A. Ventura, Mark C. Wilson, Golbon Zakeri. ppl, 9(1):53-68, 1999.
Scheduling in broadcast networksNicholas G. Hall, Wei-Ping Liu, Jeffrey B. Sidney. networks, 32(4):233-253, 1998. [doi]
Minimal path broadcast networksArthur M. Farley. networks, 43(2):61-70, 2004. [doi]
Minimal broadcast networksAsthur M. Farley. networks, 9(4):313-332, 1979. [doi]
On the construction of minimal broadcast networksLuisa Gargano, Ugo Vaccaro. networks, 19(6):673-689, 1989. [doi]
Algebraic Constructions of Efficient Broadcast Networks
… prescribed bounds on the parameters maximum node degree and broadcast diameter. The broadcast diameter of a network is the maximum time required for a message … previously been shown that hypercubes are optimal for degree k and broadcast …
Michael J. Dinneen, Michael R. Fellows, Vance Faber. AAECC 1991: 152-158
Minimum-time line broadcast networksArthur M. Farley. networks, 10(1):59-70, 1980. [doi]
An algorithm for constructing minimal c-broadcast networksShiwoo Lee, Jose A. Ventura. networks, 38(1):6-21, 2001. [doi]
A new method for constructing minimal broadcast networksJose A. Ventura, Xiaohua Weng. networks, 23(5):481-497, 1993. [doi]
Approximation algorithms for channel allocation problems in broadcast networksRajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang. networks, 47(4):225-236, 2006. [doi]
Reliable broadcast protocols in unreliable networksBaruch Awerbuch, Shilmon Event. networks, 16(4):381-396, 1986. [doi]
Compound Constructions of Broadcast Networks
… of broadcast graphs. Compound methods generate a large broadcast graph by combining multiple copies of a broadcast graph $G$ using the structure of another broadcast graph $H$. Node deletion is also allowed in some of these methods …
Michael J. Dinneen, Jose A. Ventura, Mark C. Wilson, Golbon Zakeri. DAM, 93(2-3):205-232, 1999. [doi]
Robust reconstruction of Barabási-Albert networks in the broadcast congested clique modelPablo Moisset de Espanés, Ivan Rapaport, Daniel Remenik, Ivan Rapaport, Daniel Remenik, Javiera Urrutia. networks, 67(1):82-91, 2016. [doi]
An Optimal Family of Bounded-Degree Broadcast Networks
… a ``broadcast''. We present, for the first time, a set of largest-known directed networks satisfied specified bounds on node degree and broadcast time. We also presents a family of optimal ($\Delta$, $\Delta+1$) broadcast digraphs …
Michael J. Dinneen, Nian Zhou. ENTCS, 78:196-208, 2003. [doi]
Optimal Assignments in Broadcast NetworksJames B. Sinclair. TC, 37(5):521-531, 1988.
Implementation of Eventcounts in a Broadcast NetworkKenneth Bullis, William R. Franta. cn, 4:57-69, 1980.
Data Transfers in Broadcast NetworksAnindo Bagchi, S. Louis Hakimi. TC, 41(7):842-847, 1992.
Finding OR in a noisy broadcast networkUriel Feige, Joe Kilian. ipl, 73(1-2):69-75, 2000. [doi]
Broadcast Networks of Bounded DegreeArthur L. Liestman, Joseph G. Peters. siamdm, 1(4):531-540, 1988.

Sign in or sign up to see more results.

runs on WebDSL