Sciweavers

1576 search results - page 39 / 316
» Properties of Synthetic Optimization Problems
Sort
View
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
14 years 11 months ago
Minimizing Communication Cost in Distributed Multi-query Processing
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
Jian Li, Amol Deshpande, Samir Khuller
FSTTCS
2010
Springer
13 years 8 months ago
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
Gagan Goel, Pushkar Tripathi, Lei Wang
WWW
2005
ACM
14 years 10 months ago
On optimal service selection
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet b...
Piero A. Bonatti, P. Festa
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
14 years 4 months ago
Binary Matrix Factorization with Applications
An interesting problem in Nonnegative Matrix Factorization (NMF) is to factorize the matrix X which is of some specific class, for example, binary matrix. In this paper, we exten...
Zhongyuan Zhang, Tao Li, Chris H. Q. Ding, Xiangsu...
MP
1998
113views more  MP 1998»
13 years 9 months ago
Generalized semi-infinite optimization: A first order optimality condition and examples
We consider a generalized semi-infinite optimization problem (GSIP) of the form (GSIP) min{f(x) Ix E M}, where M = {x E N"lhi(x ) = 0, i = 1,...,m, G(x,y) /> 0, y E Y(x)} ...
Hubertus Th. Jongen, Jan-J. Rückmann, Oliver ...