207 search results - page 34 / 42 » Run-Time Switching Between Total Order Algorithms |
ICCCN
2008
IEEE
14 years 1 months ago
2008
IEEE
—In mobile ad hoc networks, solving the standard problems encountered in fixed networks can be challenging because of the unpredictable motion of mobile nodes. Due to the lack o...
FCT
2003
Springer
14 years 18 days ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
ICPP
2003
IEEE
14 years 20 days ago
2003
IEEE
A hardware-assisted design, dubbed cache-oriented multistage structure (COMS), is proposed for fast packet forwarding. COMS incorporates small on-chip cache memory in its constitu...
SC
2009
ACM
14 years 2 months ago
2009
ACM
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
SIGMETRICS
2011
ACM
12 years 10 months ago
2011
ACM
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ...