Sciweavers

1483 search results - page 130 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
MP
2002
195views more  MP 2002»
15 years 1 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 2 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
ATAL
2005
Springer
15 years 7 months ago
Allocation of indivisible goods: a general model and some complexity results
Many industrial or research activities are so expensive that it is often benefitable for the involved agents to cofund the construction or the purchase of a common required resou...
Sylvain Bouveret, Michel Lemaître, Hé...
CVPR
2012
IEEE
13 years 3 months ago
Robust camera self-calibration from monocular images of Manhattan worlds
We focus on the detection of orthogonal vanishing points using line segments extracted from a single view, and using these for camera self-calibration. Recent methods view this pr...
Horst Wildenauer, Allan Hanbury
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
15 years 2 months ago
The study for transportation planning considered the inventory using hybrid genetic algorithm
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
Shinichiro Ataka, Mitsuo Gen