2280 search results - page 169 / 456 » Global Optimization for Optimal Generalized Procrustes Analy... |
172
Voted
EUROPAR
2004
Springer
16 years 2 days ago
2004
Springer
Several optimization techniques are hindered by uncertainties about the control flow in a program, which can generally not be determined by static methods at compile time. We pres...
191
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
167
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
320
click to vote
DCC
2011
IEEE
15 years 1 months ago
2011
IEEE
Quantizers for probabilistic sources are usually optimized for mean-squared error. In many applications, maintaining low relative error is a more suitable objective. This measure ...
195
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...