Sciweavers

6102 search results - page 117 / 1221
» Generating Optimizing Specializers
Sort
View
CCO
2001
Springer
157views Combinatorics» more  CCO 2001»
14 years 1 months ago
Lagrangian Relaxation
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
Claude Lemaréchal
GECCO
2010
Springer
253views Optimization» more  GECCO 2010»
13 years 11 months ago
Comparison of G3PCX and Rosenbrock's algorithms on the BBOB noiseless testbed
Generalized generation gap algorithm with parent centric crossover is compared with Rosenbrock’s optimization algorithm. Both algorithms were already presented at the BBOB 2009 ...
Petr Posík
ANOR
2007
165views more  ANOR 2007»
13 years 9 months ago
Financial scenario generation for stochastic multi-stage decision processes as facility location problems
The quality of multi-stage stochastic optimization models as they appear in asset liability management, energy planning, transportation, supply chain management, and other applicat...
Ronald Hochreiter, Georg Ch. Pflug
ICRA
2010
IEEE
148views Robotics» more  ICRA 2010»
13 years 7 months ago
Geodesic trajectory generation on learnt skill manifolds
Abstract— Humanoid robots are appealing due to their inherent dexterity. However, these potential benefits may only be realized if the corresponding motion synthesis procedure i...
Ioannis Havoutis, Subramanian Ramamoorthy
DAC
2006
ACM
14 years 10 months ago
Generation of yield-aware Pareto surfaces for hierarchical circuit design space exploration
Pareto surfaces in the performance space determine the range of feasible performance values for a circuit topology in a given technology. We present a non-dominated sorting based ...
Saurabh K. Tiwary, Pragati K. Tiwary, Rob A. Ruten...