3146 search results - page 584 / 630 » Efficient Consequence Finding |
GLOBECOM
2006
IEEE
14 years 1 months 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...
CONEXT
2006
ACM
14 years 1 months ago
2006
ACM
In this paper, we present a Mobile Agents based Framework for Routing and Congestion control in Mobile Ad Hoc Networks (MAFRC). The framework uses a cross-layer design approach wh...
MM
2006
ACM
14 years 1 months ago
2006
ACM
We present an efficient system for video search that maximizes the use of human bandwidth, while at the same time exploiting the machine’s ability to learn in real-time from use...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Power consumption is a troublesome design constraint for emergent systems such as IBM’s BlueGene /L. If current trends continue, future petaflop systems will require 100 megawat...