14548 search results - page 91 / 2910 » The Optimal Path-Matching Problem |
CEC
2009
IEEE
14 years 4 months ago
2009
IEEE
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
METMBS
2003
13 years 11 months ago
2003
— We describe a stochastic optimization method that can be used to solve inverse problems in epidemic modelling. Although in general it cannot be expected that these inverse prob...
SIAMSC
2011
13 years 5 months ago
2011
We propose a new discontinuous Galerkin (DG) method based on [9] to solve a class of Hamilton-Jacobi equations that arises from optimal control problems. These equations are connec...
FGCS
2000
13 years 10 months ago
2000
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...