4843 search results - page 488 / 969 » The Shortcut Problem - Complexity and Approximation |
146
click to vote
NIPS
2003
15 years 7 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 ...
184
click to vote
HEURISTICS
2008
15 years 4 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...
141
click to vote
CP
2010
Springer
15 years 4 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...
159
click to vote
FOCM
2011
15 years 1 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 ...
137
click to vote
JNS
2010
15 years 1 months ago
2010
Under certain conditions the problem of morphogenesis in development and the problem of morphology in block copolymers may be reduced to one geometric problem. In two dimensions t...