Sciweavers

8 search results - page 1 / 2
» Smoothed analysis of condition numbers and complexity implic...
Sort
View
MP
2011
12 years 11 months ago
Smoothed analysis of condition numbers and complexity implications for linear programming
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
John Dunagan, Daniel A. Spielman, Shang-Hua Teng
MP
2007
95views more  MP 2007»
13 years 4 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
13 years 5 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 5 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
SCA
2007
13 years 7 months ago
Smooth movers: perceptually guided human motion simulation
To animate a character, a number of poses are displayed in quick succession in order to create the illusion of motion. For most real-time applications, such as games, the pose upd...
Rachel McDonnell, Fiona N. Newell, Carol O'Sulliva...