• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Efficient SAT-based dynamic compaction and relaxation for longest sensitizable paths.

Matthias SauerSven ReimerTobias SchubertIlia PolianBernd Becker
Published in: DATE (2013)
Keyphrases
  • dynamic environments
  • upper bound
  • computationally expensive
  • active learning
  • dynamic programming
  • mobile robot
  • lightweight
  • constraint satisfaction problems
  • convex relaxation