225 search results - page 26 / 45 » Approximating Parameterized Convex Optimization Problems |
SIAMCO
2008
13 years 8 months ago
2008
We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control constraints and cost are all described by...
ISPD
1998
ACM
14 years 21 days ago
1998
ACM
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
ISAAC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—This paper studies the problem of allocating network capacity through periodic auctions. Motivated primarily by a service overlay architecture, we impose the following condition...
JMLR
2010
2010
Maximum Likelihood in Cost-Sensitive Learning: Model Specification, Approximations, and Upper Bounds
13 years 3 months ago
The presence of asymmetry in the misclassification costs or class prevalences is a common occurrence in the pattern classification domain. While much interest has been devoted to ...