Login / Signup

An efficient algorithm for a sharp approximation of universally quantified inequalities.

Alexandre GoldsztejnClaude MichelMichel Rueher
Published in: SAC (2008)
Keyphrases
  • computational complexity
  • learning algorithm
  • search strategy
  • dynamic programming
  • simulated annealing
  • np hard
  • linear programming
  • combinatorial optimization