2244 search results - page 146 / 449 » A new heuristic approach for non-convex optimization problem... |
164
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
132
click to vote
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
We investigate how a niching based evolutionary algorithm fares on the BBOB function test set, knowing that most problems are not very well suited to this algorithm class. However...
188
click to vote
PDPTA
2004
15 years 7 months ago
2004
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
174
click to vote
INFOCOM
2007
IEEE
16 years 21 days ago
2007
IEEE
— By posing the problem of bandwidth allocation as a constrained maximization problem, it is possible to study various features of optimal bandwidth allocation, and hence the cap...
159
click to vote
ICARCV
2002
IEEE
15 years 11 months ago
2002
IEEE
Integral quadratic constraints (IQC) arise in many optimal and/or robust control problems. The IQC approach can be viewed as a generalization of the classical multiplier approach ...