870 search results - page 21 / 174 » A New Approach to Modeling and Solving Minimal Perturbation ... |
154
click to vote
SCALESPACE
2009
Springer
16 years 15 days ago
2009
Springer
Abstract. In this paper we provide a method to find global minimizers of certain non-convex 2-phase image segmentation problems. This is achieved by formulating a convex minimizat...
162
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
166
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
149
click to vote
ANOR
2005
15 years 5 months ago
2005
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
174
click to vote
EOR
2002
15 years 5 months ago
2002
We present a genetic algorithm for heuristically solving a cost minimization problem applied to communication networks with threshold based discounting. The network model assumes t...