2157 search results - page 106 / 432 » Binary ant algorithm |
103
click to vote
WEA
2010
Springer
15 years 7 months ago
2010
Springer
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
CCCG
2003
15 years 1 months ago
2003
We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for su...
105
click to vote
CG
2002
Springer
15 years 10 days ago
2002
Springer
: In raster graphics, a line is displayed as a sequence of connected pixels that best approximate the line with minimum deviation. The displacement code of a line is a sequence of ...
112
click to vote
FMCAD
2007
Springer
15 years 6 months ago
2007
Springer
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
103
Voted
DGCI
2005
Springer
15 years 6 months ago
2005
Springer
Topology is a fundamental property of shapes in pictures. Since the input for any image analysis algorithm is a digital image, which does not need to have the same topological char...