16188 search results - page 115 / 3238 » The Optimal PAC Algorithm |
126
click to vote
ICICIC
2006
IEEE
15 years 6 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
120
Voted
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
When evolutionary algorithms are used for solving numerical constrained optimization problems, how to deal with the relationship between feasible and infeasible individuals can dir...
106
Voted
ICTAI
2000
IEEE
15 years 5 months ago
2000
IEEE
This paper presents a problem-independent framework that uni es various mechanisms for solving discrete constrained nonlinear programming (NLP) problems whose functions are not ne...
103
click to vote
CEC
2009
IEEE
15 years 4 months ago
2009
IEEE
— The urban transit routing problem (UTRP) for public transport systems involves finding a set of efficient transit routes to meet customer demands. The UTRP is an NPHard, high...
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— Motivated by some crowd motion models in the presence of noise, we consider an optimal control problem governed by the Fokker-Planck equation. We sketch optimality conditions b...