17760 search results - page 172 / 3552 » A Generalization of the Massey-Ding Algorithm |
113
Voted
SIAMJO
2002
15 years 3 months ago
2002
We give a pattern search method for nonlinearly constrained optimization that is an adaption of a bound constrained augmented Lagrangian method first proposed by Conn, Gould, and T...
NECO
2007
15 years 3 months ago
2007
ASPDAC
2010
ACM
15 years 2 months ago
2010
ACM
115
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
104
click to vote
GMP
2003
IEEE
15 years 9 months ago
2003
IEEE
We present a general walk-through point location algorithm for use with general polyhedron lattices and polygonal meshes assuming the usage of nothing more than a simple linked li...