3247 search results - page 180 / 650 » Randomized smoothing networks |
147
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
131
click to vote
ICONIP
1998
15 years 5 months ago
1998
Despite all the progress in neural networks the technology is still brittle and sometimes difficult to apply. Automatic construction of networks and proper initialization of their...
135
click to vote
WCE
2007
15 years 5 months ago
2007
— The rapid transit network design problem considers at upper level the list of potential transit corridors and stations to design the network as a discrete space of alternatives...
151
click to vote
ADHOC
2006
15 years 4 months ago
2006
We show that there is a trade-off among mobility, capacity, and delay in ad hoc networks. More specifically, we consider two schemes for node mobility in ad hoc networks. We divid...
144
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— In this paper, we consider the problem of stabilizing sufficiently smooth nonlinear time-invariant plants over a network whereby feedback is closed through a limitedba...