Login / Signup

Lower bounds for dynamic BDD reordering.

Rüdiger EbendtRolf Drechsler
Published in: ASP-DAC (2005)
Keyphrases
  • lower bound
  • upper bound
  • objective function
  • branch and bound algorithm
  • dynamically changing
  • real time
  • information systems
  • website
  • case study
  • data structure
  • scheduling problem
  • worst case
  • optimal cost