Login / Signup

PUB: Path Upper-Bounding for Measurement-Based Probabilistic Timing Analysis.

Leonidas KosmidisJaume AbellaFranck WartelEduardo QuiñonesAntoine ColinFrancisco J. Cazorla
Published in: ECRTS (2014)
Keyphrases
  • upper bounding
  • upper bound
  • branch and bound algorithm
  • lower bound
  • lower bounding
  • probabilistic model
  • bayesian networks
  • nearest neighbor
  • feature selection
  • scheduling problem
  • shortest path