3625 search results - page 388 / 725 » On Timed Models of Gene Networks |
181
click to vote
SIGMETRICS
2008
ACM
15 years 6 months ago
2008
ACM
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
194
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Throughput capacity in wireless ad hoc networks has been studied extensively under many different mobility models such as i.i.d. mobility model, Brownian mobility model, random ...
220
click to vote
FSTTCS
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
171
click to vote
SIROCCO
2004
15 years 8 months ago
2004
Abstract. We study asynchronous packet radio networks in which transmissions among nodes may be delayed. We consider the task of broadcasting a message generated by the source node...
177
click to vote
GLOBECOM
2006
IEEE
16 years 25 days ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...