7189 search results - page 106 / 1438 » Connecting Design with Code |
137
click to vote
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
132
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
110
click to vote
GC
2007
Springer
15 years 2 months ago
2007
Springer
We develop Gray code enumeration schemes for geometric graphs in the plane. The considered graph classes include plane straight-line graphs, plane spanning trees, and connected pl...
141
click to vote
INFOCOM
1998
IEEE
15 years 6 months ago
1998
IEEE
In this paper, we investigate the extent to which fair queueing (and its variants), in conjunction with appropriately tailored buffer management schemes, can be used to achieve th...
98
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We consider i) the overhead minimization of maximum-distance seperable (MDS) storage codes for the repair of a single failed node and ii) the total secure degrees-of-freedom (S-DoF...