427 search results - page 17 / 86 » A Subexponential Bound for Linear Programming |
EOR
2010
13 years 2 months ago
2010
We analyze the problem of pricing and hedging contingent claims in the multi-period, discrete time, discrete state case using the concept of a sufficiently attractive expected gai...
COR
2006
13 years 7 months ago
2006
A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying br...
ICCV
2009
IEEE
15 years 19 days ago
2009
IEEE
We consider a class of region-based energies for image
segmentation and inpainting which combine region integrals
with curvature regularity of the region boundary. To
minimize s...
IPMI
2007
Springer
14 years 8 months ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Bloat is a common and well studied problem in genetic programming. Size and depth limits are often used to combat bloat, but to date there has been little detailed explor...