390 search results - page 71 / 78 » Computing shortest paths for any number of hops |
MICRO
2006
IEEE
14 years 11 months ago
2006
IEEE
Predication facilitates high-bandwidth fetch and large static scheduling regions, but has typically been too complex to implement comprehensively in out-of-order microarchitecture...
120
click to vote
DCOSS
2010
Springer
15 years 3 months ago
2010
Springer
A number of protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antenn...
TIT
2008
14 years 11 months ago
2008
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
CN
2007
14 years 11 months ago
2007
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
106
click to vote
WINET
2002
14 years 11 months ago
2002
Wireless ad-hoc sensor networks have the potential to provide the missing interface between the physical world and the Internet, thus impacting a large number of users. This conne...