Binary Space Partition (BSP) tree and Constructive Solid Geometry (CSG) tree representations are both set-theoretic binary tree representations of solid objects used in solid modeling and computer graphics. Recently, an extension of the traditional BSP tree definition has been presented, in which surfaces used in the binary partition include curved surfaces in addition to planar surfaces. We ex...

Partitioning a digital circuit into modules before implementing on a single chip is key to balancing between test cost and test correctness of built-in current testing (BICT). Most partitioning methods use statistic analysis to find the threshold value and then to determine the size of a module. These methods are rigid and inflexible since IDDQ testing requires the measurement of an analog quan...

The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality has been presented in this current paper. Such type of facets plays an important role in set covering set partitioning, matroidal-intersection vertex- packing, generalized assignment and other combinatorial problems. Strong covers for facets of Knapsack ploytope has been developed in the first pa...

In this paper, we propose separation set partitioning algorithm for partitioning nonstrict programs into threads using participation set and separation set and extened it to global partitioning. Separation set partitioning algorithm can merge threads which dependence set and demand set partitioning algorithm may fail to merge. It deals with certain indirect depdendences and potential indirect d...

We present a dynamic branching scheme for set partitioning problems. The idea is to trace features of the underlying MIP model and base search decisions on current subproblem be solved. show how such system can trained efficiently by introducing minimal learning bias that traditional model-based machine approaches rely on. Experiments highly heterogeneous collection instances significant gains ...