2542 search results - page 6 / 509 » Computing Cartograms with Optimal Complexity |
EUROGP
2001
Springer
14 years 2 days ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
ICIP
1998
IEEE
14 years 9 months ago
1998
IEEE
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
GECCO
2009
Springer
13 years 5 months ago
2009
Springer
Cooperative approaches have proved to be very useful in evolutionary computation due to their ability to solve efficiently high-dimensional complex problems through the cooperatio...
ANTS
1994
Springer
13 years 11 months ago
1994
Springer
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
ICDCS
1999
IEEE
13 years 12 months ago
1999
IEEE