220 search results - page 6 / 44 » Minimizing Average Flow-time : Upper and Lower Bounds |
INFOCOM
2003
IEEE
13 years 12 months ago
2003
IEEE
ACT We consider an optimal power and rate scheduling problem for a single user transmitting to a base station on a fading wireless link with the objective of minimizing the mean de...
SAT
2005
Springer
14 years 5 days ago
2005
Springer
We tackle the problem of finding a smallest-cardinality MUS (SMUS) of a given formula. The SMUS provides a succinct explanation of infeasibility and is valuable for applications th...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
ICC
2009
IEEE
13 years 4 months ago
2009
IEEE
Abstract--We present and analyze two different power allocation strategies for considerably improving the average bit error rate (BER) performance of wireless multihop systems with...
ISLPED
1998
ACM
13 years 11 months ago
1998
ACM
- The objective of this paper is to provide lower and upper bounds for the switching activity on the state lines in Finite State Machines (FSMs). Using a Markov chain model for the...