3020 search results - page 418 / 604 » Optimal partition trees |
155
click to vote
SEFM
2003
IEEE
15 years 11 months ago
2003
IEEE
The Specification and Description Language (SDL) together with its associated tool sets can be used for the generation of Tree and Tabular Combined Notation (TTCN) test cases. Sur...
166
click to vote
COCOON
2001
Springer
15 years 11 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
185
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
160
click to vote
IPCO
2001
15 years 7 months ago
2001
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
165
click to vote
WSCG
2004
15 years 7 months ago
2004
Recent research has demonstrated the effectiveness of complex skeletal primitives such as subdivision curves and surfaces in implicit surface modeling. This paper presents a hiera...