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

Jean-Cédric Chappelier, Martin Rajman (2000)

> Home

Details and statistics

DOI: 10.1007/3-540-45154-4_10

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/nlp/ChappelierR00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nlp/ChappelierR00
Jean-Cédric Chappelier, Martin Rajman:
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing. Natural Language Processing 2000: 106-117

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.