248 search results - page 4 / 50 » Performance and stability bounds for dynamic networks |
123
Voted
WIOPT
2011
IEEE
14 years 3 months ago
2011
IEEE
Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...
113
click to vote
INFOCOM
1998
IEEE
1998
IEEE
Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints
15 years 4 months ago
-We derive bounds for the performance of dynamic channel assignment (DCA) schemeswhich strengthenthe existing Erlang bound. The construction of the bounds is based on a reward para...
JMLR
2008
15 years 6 days ago
2008
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
113
click to vote
MOBIHOC
2012
ACM
13 years 2 months ago
2012
ACM
Longest-queue-first (LQF) link scheduling is a greedy link scheduling in multihop wireless networks. Its stability performance in single-channel single-radio (SC-SR) wireless net...
121
Voted
ENGL
2008
15 years 9 days ago
2008
This paper presents a neural network global PID-sliding mode control method for the tracking control of robot manipulators with bounded uncertainties. A certain sliding mode contro...