CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 4645-4857
Annnotations
CORD-19_Custom_license_subset
{"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T34","span":{"begin":0,"end":212},"obj":"Sentence"}],"text":"Considering the limitation caused by greedy algorithm inefficiency, we then propose two alternative Monte-Carlo methods, each having its pros and cons, to estimate the #P-hard objective function D(S) efficiently."}
CORD-19-Sentences
{"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T34","span":{"begin":0,"end":212},"obj":"Sentence"},{"id":"TextSentencer_T34","span":{"begin":0,"end":212},"obj":"Sentence"},{"id":"T63730","span":{"begin":0,"end":212},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"Considering the limitation caused by greedy algorithm inefficiency, we then propose two alternative Monte-Carlo methods, each having its pros and cons, to estimate the #P-hard objective function D(S) efficiently."}