1480 search results - page 152 / 296 » Distributed algorithms for weighted problems in sparse graph... |
123
Voted
ALGORITHMICA
2011
14 years 7 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
114
Voted
ICCAD
2009
IEEE
14 years 10 months ago
2009
IEEE
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
113
Voted
INFOCOM
2003
IEEE
15 years 6 months ago
2003
IEEE
—Existing research demonstrated that an effective Routing and Wavelength Assignment (RWA) scheme and a wavelength converter placement algorithm are the two primary vehicles for i...
119
Voted
SPAA
2006
ACM
15 years 6 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
118
Voted
IWDC
2005
Springer
15 years 6 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...