584 search results - page 29 / 117 » Combinatorial optimization problems in wireless switch desig... |
JPDC
2006
13 years 7 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constrai...
IPCO
1992
13 years 8 months ago
1992
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
AHSWN
2006
13 years 7 months ago
2006
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— This paper revisits burst contention resolution problems in optical burst switching (OBS) networks from the viewpoint of network utility maximization. Burst collision o...