1508 search results - page 206 / 302 » Efficient Path Profiling |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
ICUMT
2009
13 years 6 months ago
2009
Abstract--As society's dependence on network technology increases, the need for resilience and survivability in these services becomes increasingly apparent. Since the user ex...
JCIT
2010
13 years 3 months ago
2010
In peer-to-peer networks, it is very difficult to route query successfully, since nodes in the routing path do not always behave according to pre-established routing protocols. To...
WINET
2010
13 years 3 months ago
2010
In this paper, we consider filtering false reports in braided multipath routing sensor networks. While multipath routing provides better resilience to various faults in sensor net...
MTA
2011
12 years 11 months ago
2011
This paper presents a novel approach for individual agent’s motion simulation in real-time virtual environments. In our model, we focus on addressing two problems: 1) the control...