895 search results - page 64 / 179 » Approximate convex decomposition |
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
AUTOMATICA
2011
14 years 1 months ago
2011
Exploiting spectral properties of symmetric banded Toeplitz matrices, we describe simple sufficient conditions for positivity of a trigonometric polynomial formulated as linear ma...
EMNLP
2010
14 years 7 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
JCAM
2011
14 years 21 days ago
2011
In this paper we discuss multiperiod portfolio selection problems related to a speci…c provisioning problem. Our results are an extension of Dhaene et al. (2005), where optimal ...