4894 search results - page 499 / 979 » The Guarding Problem - Complexity and Approximation |
191
click to vote
WSC
2008
15 years 7 months ago
2008
We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured th...
124
click to vote
NIPS
2003
15 years 6 months ago
2003
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
158
click to vote
HEURISTICS
2008
15 years 3 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
122
click to vote
CP
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We study the problem of maximizing the amount of stochastic diffusion in a network by acquiring nodes within a certain limited budget. We use a Sample Average Approximati...
141
click to vote
FOCM
2011
14 years 12 months ago
2011
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...