2924 search results - page 143 / 585 » Lower Bounds in Distributed Computing |
132
Voted
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
111
Voted
ICPP
2002
IEEE
15 years 5 months ago
2002
IEEE
Recently, several experimental studies have been conducted on block data layout as a data transformation technique used in conjunction with tiling to improve cache performance. In...
102
click to vote
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—This paper studies the maximum throughput that can be supported by a given wireless mesh backhaul network, over a practical CSMA/CA medium access control (MAC) protocol. We reso...
101
click to vote
SIGMETRICS
2005
ACM
15 years 6 months ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
98
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...