14739 search results - page 272 / 2948 » An optimization problem on the sphere |
CCCG
2007
15 years 20 days ago
2007
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
103
click to vote
DISOPT
2007
14 years 11 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
IJKESDP
2010
14 years 9 months ago
2010
— In this paper, several portfolio selection problems with normal mixture distributions including fuzziness are proposed. Until now, many researchers have proposed portfolio mode...
110
click to vote
SIAMSC
2010
14 years 9 months ago
2010
In this paper, we study alternating direction methods for solving constrained total-variation image restoration and reconstruction problems. Alternating direction methods can be im...
130
click to vote
EVOW
2007
Springer
15 years 5 months 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...