most citedA New Approach for Resource Scheduling with Deep Reinforcement Learning

11 citations · 11 across the 2 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2018

An Efficient Method to Transform SAT problems to Binary Integer Linear Programming Problem

Wenxia Guo, Jin Wang, Majun He +3

In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. Although a solution to a NP-complete can be verified quickly, there is no k…