Search engines largely rely on robots (i.e., crawlers or spiders) to collect information from the Web. Such crawling activities can be regulated from the server side by deploying ...
Yang Sun, Ziming Zhuang, Isaac G. Councill, C. Lee...
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...
The size, complexity, heterogeneity, and dynamism of largescale computational grids make autonomic grid services and solutions necessary. In particular, grid schedulers must map a...
Deger Cenk Erdil, Michael J. Lewis, Nael B. Abu-Gh...
—This paper presents an Improved Snake Model (ISM) effective for performing fast image segmentation. The work takes advantage of two well-known snake models of Balloon [1] and GG...
— Energy-efficient broadcast communication is an important problem in wireless ad hoc networks. Previously, minimum-energy broadcast that exploits the broadcast nature of radio ...
Sabyasachi Roy, Y. Charlie Hu, Dimitrios Peroulis,...