Sciweavers

1617 search results - page 105 / 324
» Constraints in Weighted Averaging
Sort
View
TWC
2008
117views more  TWC 2008»
15 years 6 months ago
Achievable Rates and Fairness in Rateless Coded Relaying Schemes
Abstract--The average throughput of three decode-andforward (DF) half-duplex (DFHD) and two DF full-duplex (DFFD) rateless coded relaying schemes are studied under a peak power con...
Reza Nikjah, Norman C. Beaulieu
ICS
2004
Tsinghua U.
15 years 11 months ago
Inter-reference gap distribution replacement: an improved replacement algorithm for set-associative caches
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...
Masamichi Takagi, Kei Hiraki
SODA
2012
ACM
240views Algorithms» more  SODA 2012»
13 years 8 months ago
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem. This problem consists...
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Za...
ICRA
2003
IEEE
120views Robotics» more  ICRA 2003»
15 years 11 months ago
Extracting optimal paths from roadmaps for motion planning
We present methods for extracting optimal paths from motion planning roadmaps. Our system enables any combination of optimization criteria, such as collision detection, kinematic/...
Jinsuck Kim, Roger A. Pearce, Nancy M. Amato
UAI
2008
15 years 7 months ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht