We show that the combination of dynamic programming with partial-order decomposition algorithms enables us to solve sequencing problems in polynomial time for substantially larger classes of ...
Mathematics of Operations Research, Vol. 12, No. 1 (Feb., 1987), pp. 22-31 (10 pages) With the recent development of efficient algorithms for locating modules in a precedence network, a new class of ...
Seeking to reduce the computing power needed for the widely used dynamic mode decomposition algorithm, a team of researchers in China led by Guo-Ping Guo developed a quantum-classical hybrid algorithm ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback