4565 search results - page 270 / 913 » Time Optimal Self-Stabilizing Algorithms |
130
Voted
CONSTRAINTS
2008
15 years 25 days ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
100
Voted
CORR
2002
Springer
15 years 17 days ago
2002
Springer
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
95
Voted
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
— In this paper, a neural network approach is presented to expand the Pareto-optimal front for multiobjective optimization problems. The network is trained using results obtained...
90
Voted
ICCSA
2005
Springer
15 years 6 months ago
2005
Springer
Various global optimization methods are compared in order to find the best strategy to solve realistic drag reduction problems in the automotive industry. All the methods consist ...
141
Voted
GECCO
2010
Springer
14 years 10 months ago
2010
Springer
We benchmark the Covariance Matrix Adaptation-Evolution Strategy (CMA-ES) algorithm with an Increasing POPulation size (IPOP) restart policy on the BBOB noiseless testbed. The IPO...