Abstract: We present CLIPPER+, an algorithm for finding maximal cliques in unweighted graphs for outlier-robust global registration. The registration problem can be formulated as a graph and solved by ...
Abstract: The decomposable feature of operations in the welding shop scheduling scenario results in a vast search space, posing challenges for the design of traditional optimization algorithms.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results