Zobrazeno 1 - 10
of 152
pro vyhledávání: '"Goldengorin, Boris"'
We introduce a novel approach for image edge detection based on pseudo-Boolean polynomials for image patches. We show that patches covering edge regions in the image result in pseudo-Boolean polynomials with higher degrees compared to patches that co
Externí odkaz:
http://arxiv.org/abs/2308.15557
We introduce usage of a reduction property of penalty-based formulation of pseudo-Boolean polynomials as a mechanism for invariant dimensionality reduction in cluster analysis processes. In our experiments, we show that multidimensional data, like 4-
Externí odkaz:
http://arxiv.org/abs/2308.15553
We introduce a deterministic approach to edge detection and image segmentation by formulating pseudo-Boolean polynomials on image patches. The approach works by applying a binary classification of blob and edge regions in an image based on the degree
Externí odkaz:
http://arxiv.org/abs/2308.15453
As shown by Tang, Denardo [9] the job Sequencing and tool Switching Problem (SSP) can be decomposed into the following two problems. Firstly, the Tool Loading Problem (TLP) - for a given sequence of jobs, find an optimal sequence of magazine states t
Externí odkaz:
http://arxiv.org/abs/2207.02004
We outline a new Max Pipe Construction Algorithm (MPCA) with the purpose to reduce the CPU time for the classic Keep Tool Needed Soonest (KTNS) algorithm. The KTNS algorithm is applied to compute the objective function value for the given sequence of
Externí odkaz:
http://arxiv.org/abs/2205.06042
Autor:
Fomin, Artem, Goldengorin, Boris
We propose a Boolean Linear Programming model for the preemptive single machine scheduling problem with equal processing times, arbitrary release dates and weights(priorities) minimizing the total weighted completion time. Almost always an optimal so
Externí odkaz:
http://arxiv.org/abs/2012.08152