14548 search results - page 308 / 2910 » The Optimal Path-Matching Problem |
174
click to vote
GECCO
2004
Springer
16 years 21 hour ago
2004
Springer
This paper proposes an improved particle swarm optimizer using the notion of species to determine its neighbourhood best values, for solving multimodal optimization problems. In th...
175
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...
165
click to vote
AAIM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
176
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper, we propose a novel approach to solve constrained optimization problems based on particle swarm optimization (PSO). First, an empirical comparison of the most pop...
171
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
: Carry-save-adder(CSA) is one of the most widely used schemes for fast arithmetic in industry. This paper provides a solution to the problem of finding an optimal-timing allocatio...