3875 search results - page 139 / 775 » Approximation algorithms for the 0-extension problem |
129
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
152
click to vote
TSP
2008
15 years 4 months ago
2008
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...
129
click to vote
RTCSA
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
142
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
117
click to vote
CEC
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract- This paper presents a new operator for genetic algorithms that enhances their convergence in the case of nonlinear problems with nonlinear equality constraints. The propo...