Login / Signup

Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing.

Jean-Cédric ChappelierMartin Rajman
Published in: Natural Language Processing (2000)
Keyphrases
  • monte carlo sampling
  • np hard
  • objective function
  • lower bound
  • special case
  • scheduling problem
  • computational complexity
  • model selection
  • decision problems
  • weighted sum