Login / Signup
A strongly polynomial-time algorithm for over-constraint resolution: efficient debugging of timing constraint violations.
Ali Dasdan
Published in:
CODES (2002)
Keyphrases
</>
worst case
computational complexity
computationally efficient
search space
constraint violations
dynamic programming
optimization algorithm
benchmark problems
cost function
simulated annealing
video sequences
state space
computational efficiency