14649 search results - page 360 / 2930 » Principles of problem solving |
226
click to vote
EVOW
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
192
click to vote
GECCO
2007
Springer
16 years 27 days ago
2007
Springer
The dynamic optimization problem concerns finding an optimum in a changing environment. In the tracking problem, the optimizer should be able to follow the optimum’s changes ov...
166
click to vote
ICIP
2005
IEEE
16 years 9 days ago
2005
IEEE
The problem of adjusting the color such that the output image from a digital camera, viewed under a standard condition, matches the scene observed by the photographer’s eye is c...
146
click to vote
WABI
2005
Springer
16 years 6 days ago
2005
Springer
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...
165
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...