Sciweavers

1964 search results - page 93 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
Management of Virtual Machines on Globus Grids Using GridWay
Virtual machines are a promising technology to overcome some of the problems found in current Grid infrastructures, like heterogeneity, performance partitioning or application iso...
Antonio J. Rubio-Montero, Eduardo Huedo, Rub&eacut...
CEE
2006
92views more  CEE 2006»
13 years 8 months ago
Optimizing the performance of tree-based reliable multicast
The expected number of transmissions is a very important parameter to evaluate the multicast performance. It is often used to estimate the bandwidth consumption of tree-based reli...
Zuo Wen Wan, Michel Kadoch, Ahmed K. Elhakeem
MOBICOM
2009
ACM
14 years 2 months ago
Neighbor discovery in wireless networks and the coupon collector's problem
—Neighbor discovery1 is one of the first steps in the initialization of a wireless ad hoc network. In this paper, we design and analyze practical algorithms for neighbor discove...
Sudarshan Vasudevan, Donald F. Towsley, Dennis Goe...
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
13 years 6 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia
WWW
2004
ACM
14 years 8 months ago
Learning block importance models for web pages
Some previous works show that a web page can be partitioned to multiple segments or blocks, and usually the importance of those blocks in a page is not equivalent. Also, it is pro...
Ruihua Song, Haifeng Liu, Ji-Rong Wen, Wei-Ying Ma