Sciweavers

4432 search results - page 90 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
GECCO
2005
Springer
219views Optimization» more  GECCO 2005»
15 years 5 months ago
An evolutionary lagrangian method for the 0/1 multiple knapsack problem
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
Yourim Yoon, Yong-Hyuk Kim, Byung Ro Moon
WSC
2008
15 years 2 months ago
The mathematics of continuous-variable simulation optimization
Continuous-variable simulation optimization problems are those optimization problems where the objective function is computed through stochastic simulation and the decision variab...
Sujin Kim, Shane G. Henderson
IFIP7
2001
Springer
113views Optimization» more  IFIP7 2001»
15 years 4 months ago
Optimal Shape Design Using Domain Transformations and Continuous Sensitivity Equation Methods
In this paper, we consider two approaches to solving an optimization based design problem where “shape” is the design parameter. Both methods use domain transformations to comp...
Lisa Stanley
WABI
2005
Springer
109views Bioinformatics» more  WABI 2005»
15 years 5 months ago
Optimal Protein Threading by Cost-Splitting
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
Philippe Veber, Nicola Yanev, Rumen Andonov, Vince...
ALT
2004
Springer
15 years 8 months ago
Convergence of a Generalized Gradient Selection Approach for the Decomposition Method
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
Nikolas List