13376 search results - page 405 / 2676 » Problem Solving with |
112
click to vote
ICS
2010
Tsinghua U.
16 years 2 months ago
2010
Tsinghua U.
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
138
click to vote
IFIP7
2001
Springer
15 years 9 months ago
2001
Springer
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...
137
click to vote
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for represen...
130
click to vote
IDA
2008
Springer
15 years 4 months ago
2008
Springer
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
149
Voted
ALT
2004
Springer
16 years 1 months ago
2004
Springer
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...