Sciweavers

2157 search results - page 106 / 432
» Binary ant algorithm
Sort
View
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
15 years 12 months ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
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...
Charles Delort, Olivier Spanjaard
CCCG
2003
15 years 6 months ago
Linear Binary Space Partitions and the Hierarchy of Object Classes
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...
Petr Tobola, Karel Nechvíle
139
Voted
CG
2002
Springer
15 years 4 months ago
BRDC: binary representation of displacement code for line
: 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 ...
Lanfang Miao, Xinguo Liu, Qunsheng Peng, Hujun Bao
FMCAD
2007
Springer
15 years 11 months ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
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...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton
DGCI
2005
Springer
15 years 10 months ago
Shape Preserving Digitization of Binary Images After Blurring
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...
Peer Stelldinger, Ullrich Köthe