Sciweavers

867 search results - page 93 / 174
» The Generalized Maximum Coverage Problem
Sort
View
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 8 months ago
Towards Providing Low-Risk and Economically Feasible Network Data Transfer Services
: - In the first part of this paper we present the first steps towards providing low-risk and economically feasible network data transfer services. We introduce three types of data...
Mugurel Ionut Andreica, Vasile Deac, Stelian Tipa
PE
2006
Springer
115views Optimization» more  PE 2006»
13 years 8 months ago
Optimal processor allocation to differentiated job flows
In this paper, we study the problem of dynamic allocation of the resources of a general parallel processing system, comprised of M heterogeneous processors and M heterogeneous tra...
Kimberly M. Wasserman, George Michailidis, Nichola...
TSP
2008
115views more  TSP 2008»
13 years 6 months ago
The Estimation of Laplace Random Vectors in Additive White Gaussian Noise
This paper develops and compares the maximum a posteriori (MAP) and minimum mean-square error (MMSE) estimators for spherically contoured multivariate Laplace random vectors in add...
Ivan W. Selesnick
DAM
2007
100views more  DAM 2007»
13 years 8 months ago
Partially ordered knapsack and applications to scheduling
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
Stavros G. Kolliopoulos, George Steiner
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
13 years 7 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller