9659 search results - page 1622 / 1932 » Points on Computable Curves |
183
click to vote
GECCO
2007
Springer
16 years 29 days ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
191
click to vote
GECCO
2007
Springer
16 years 29 days ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
140
click to vote
ICALP
2007
Springer
16 years 29 days ago
2007
Springer
Say that f : {0, 1}n → {0, 1} -approximates g : {0, 1}n → {0, 1} if the functions disagree on at most an fraction of points. This paper contains two results about approximatio...
218
Voted
ICCS
2007
Springer
16 years 28 days ago
2007
Springer
Assimilation of spatially- and temporally-distributed state observations into simulations of dynamical systems stemming from discretized PDEs leads to inverse problems with high-di...
147
Voted
ISICA
2007
Springer
16 years 28 days ago
2007
Springer
In this paper the authors point out that the Pareto Optimality is unfair, unreasonable and imperfect for Many-objective Optimization Problems (MOPs) underlying the hypothesis that ...