8825 search results - page 1751 / 1765 » All for one or one for all |
MST
2010
13 years 2 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
TCAD
2010
13 years 2 months ago
2010
Abstract--In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different ex...
TCS
2010
13 years 2 months ago
2010
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the class...
TON
2010
13 years 2 months ago
2010
We identify common hypotheses on which a large number of distinct mathematical models of WLANs employing IEEE 802.11 are founded. Using data from an experimental test bed and packe...
TON
2010
13 years 2 months ago
2010
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...