7519 search results - page 133 / 1504 » Optimizing Generic Functions |
129
Voted
JGO
2008
15 years 5 months ago
2008
We show that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a level set of a single smooth function with certain r...
132
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Many engineering optimization tasks involve finding more than one optimum solution. The present study provides a comprehensive review of the existing work done in the field of mul...
176
click to vote
ISAAC
1993
Springer
15 years 9 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
267
click to vote
CP
2009
Springer
16 years 5 months ago
2009
Springer
This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coal...
173
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— A receding horizon control algorithm, originally proposed for tracking best-possible steady-states in the presence of overly stringent state and/or input constraints, is analyz...