Tensor network algorithms provide exact optimal task assignments on machines under directed constraints, with preprocessing and iterative improvements to reduce complexity.
This is done to avoid summing in the next step the compatible states differently accord- ing to their extremal relation to the constraint
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Task Scheduling Optimization with Direct Constraints from a Tensor Network Perspective
Tensor network algorithms provide exact optimal task assignments on machines under directed constraints, with preprocessing and iterative improvements to reduce complexity.