Login / Signup
Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay.
Avinash Malik
Cameron G. Walker
Michael J. O'Sullivan
Oliver Sinnen
Published in:
Comput. Oper. Res. (2018)
Keyphrases
</>
optimal scheduling
theoretical framework
np complete
set theoretic
satisfiability problem
computational complexity
scheduling problem
graph matching
search space
graph representation
propositional theories
decision procedures
graph mining
graph structure
conjunctive queries
logic programming
lower bound