3 ms·
https://link.springer.com/chapter/10.1007/3-540-45154-4_10 https://link.springer.com/chapter/10.1007/3-540-45154-4_10 Monte-Carlo Sampling for NP-Hard Maximiza
by russdill 9y ago
https://link.springer.com/chapter/10.1007/3-540-45154-4_10 https://link.springer.com/chapter/10.1007/3-540-45154-4_10
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
- Sniffnoy 9y agoThe question isn't "How can you do possibly well on NP-hard problems?" It's, what particular tricks are these people using that allow them to get around the NP-hardness of this particular problem? The article doesn't talk about that and it should.