401 search results - page 45 / 81 » Random Early Marking |
111
Voted
DEBU
2010
14 years 9 months ago
2010
The high random and sequential I/O requirements of contemplated workloads could serve as impetus to move faster towards storage-class memory (SCM), a technology that will blur the...
150
click to vote
TSP
2010
14 years 7 months ago
2010
Abstract-- This paper presents greedy gossip with eavesdropping (GGE), a new average consensus algorithm for wireless sensor network applications. Consensus algorithms have recentl...
136
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
Tracking in a multipath environment poses many challenges. It is worth while to quantify the achievable performance bounds in such an environment. However finding the performance...
110
click to vote
ICASSP
2009
IEEE
15 years 7 months ago
2009
IEEE
This paper analyzes the rate of convergence of greedy gossip with eavesdropping (GGE). In previous work, we proposed GGE, a fast gossip algorithm based on exploiting the broadcast...
110
click to vote
IJCAI
2001
15 years 1 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...