Sciweavers

1265 search results - page 136 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 3 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
INFOCOM
2011
IEEE
13 years 25 days ago
Consolidating virtual machines with dynamic bandwidth demand in data centers
—Recent advances in virtualization technology have made it a common practice to consolidate virtual machines(VMs) into a fewer number of servers. An efficient consolidation sche...
Meng Wang, Xiaoqiao Meng, Li Zhang 0002
ICDCS
2007
IEEE
14 years 3 months ago
A Weighted Moving Average-based Approach for Cleaning Sensor Data
Nowadays, wireless sensor networks have been widely used in many monitoring applications. Due to the low quality of sensors and random effects of the environment, however, it is ...
Yongzhen Zhuang, Lei Chen 0002, Xiaoyang Sean Wang...
CORR
2002
Springer
123views Education» more  CORR 2002»
13 years 9 months ago
Survey propagation: an algorithm for satisfiability
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
Alfredo Braunstein, Marc Mézard, Riccardo Z...
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
13 years 8 months ago
A Note on the Expected Time for Finding Maxima by List Algorithms
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
Luc Devroye