584 search results - page 24 / 117 » Combinatorial optimization problems in wireless switch desig... |
IANDC
2006
14 years 11 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...
124
click to vote
FOCS
2005
IEEE
15 years 5 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 ...
100
click to vote
VTC
2010
IEEE
14 years 10 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
16 years 1 days 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...
101
click to vote
JSAC
2008
14 years 11 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...