Sign in

Approximating schedules for dynamic process graphs efficiently.

Andreas JakobyMaciej LiskiewiczRüdiger Reischuk
Published in: J. Discrete Algorithms (2004)
Keyphrases
  • data mining
  • machine learning
  • probabilistic model
  • graph theory
  • optimal solution
  • pattern recognition
  • scheduling problem
  • dynamic environments