584 search results - page 24 / 117 » Combinatorial optimization problems in wireless switch desig... |
IANDC
2006
13 years 7 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
VTC
2010
IEEE
13 years 6 months ago
2010
IEEE
—Supporting a multimode mobile device to seamlessly switch its connections between various wireless access networks, such as WiMAX, Wi-Fi, and LTE, is an important research issue...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
JSAC
2008
13 years 7 months ago
2008
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...