116 search results - page 2 / 24 » Solving network design problems via iterative aggregation |
ICC
2007
IEEE
13 years 9 months ago
2007
IEEE
Relay power allocation has been shown to provide substantial performance gain in wireless relay networks when perfect global channel state information (CSI) is available. In this p...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
SC
2009
ACM
13 years 10 months ago
2009
ACM
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
FOCM
2010
13 years 3 months ago
2010
Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower dimensional set consisting of the discontinuities of the funct...