Sciweavers

2735 search results - page 94 / 547
» Comparing notions of randomness
Sort
View
DATE
2009
IEEE
92views Hardware» more  DATE 2009»
14 years 3 months ago
Using randomization to cope with circuit uncertainty
—Future computing systems will feature many cores that run fast, but might show more faults compared to existing CMOS technologies. New software methodologies must be adopted to ...
Hamid Safizadeh, Mohammad Tahghighi, Ehsan K. Arde...
IPPS
2009
IEEE
14 years 3 months ago
Robust sequential resource allocation in heterogeneous distributed systems with random compute node failures
—The problem of finding efficient workload distribution techniques is becoming increasingly important today for heterogeneous distributed systems where the availability of comp...
Vladimir Shestak, Edwin K. P. Chong, Anthony A. Ma...
INFOCOM
2007
IEEE
14 years 3 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
ISCC
2007
IEEE
127views Communications» more  ISCC 2007»
14 years 3 months ago
Head-to-Tail: Managing Network Load through Random Delay Increase
Window-based congestion control is typically based on exhausting bandwidth capacity, which occasionally leads to transient congestion. Moreover, flow synchronization may deteriora...
Stylianos Dimitriou, Vassilis Tsaoussidis
APPROX
2004
Springer
108views Algorithms» more  APPROX 2004»
14 years 2 months ago
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
Sumit Ganguly