{"id":"W3045974926","doi":"10.1007/s10922-020-09555-8","title":"Monte Carlo Tree Search with Last-Good-Reply Policy for Cognitive Optimization of Cloud-Ready Optical Networks","year":2020,"lang":"en","type":"article","venue":"Journal of Network and Systems Management","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"British Columbia Institute of Technology","funders":"Narodowe Centrum Nauki","keywords":"Computer science; Monte Carlo tree search; Cloud computing; Data center; Network topology; Tree (set theory); Novelty; Blocking (statistics); Resource allocation; Focus (optics); Key (lock); Distributed computing; Monte Carlo method; Computer network","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003015311,0.001131861,0.003079538,0.00154739,0.001344187,0.001711513,0.002394539,0.002878861,0.005288132],"category_scores_gemma":[0.01005665,0.0009429923,0.0009761978,0.001638162,0.001819463,0.002069602,0.001806179,0.001988366,0.0003591462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002124749,"about_ca_system_score_gemma":0.004759313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01633055,"about_ca_topic_score_gemma":0.01621183,"domain_scores_codex":[0.998654,0.0005875357,0.00003977958,0.0001484105,0.000174512,0.0003957312],"domain_scores_gemma":[0.9907405,0.007868242,0.000309412,0.0001676961,0.0005547647,0.000359303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001645972,0.00006613129,0.0002696205,0.00003460126,0.00003426304,0.00003052925,0.00002975153,0.9858873,0.0001177533,0.006503825,0.001209311,0.005652292],"study_design_scores_gemma":[0.00001318163,0.00001051308,0.00002272422,0.000002437842,0.000004654255,0.000002820849,0.00000507191,0.9980682,0.00001903954,0.001811064,0.00003807787,0.000002171794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.123623,0.002139324,0.8558925,0.002488001,0.0003951949,0.000231441,0.0002295396,0.0007366853,0.01426427],"genre_scores_gemma":[0.9309673,0.0003161145,0.0638766,0.0005133129,0.0001363128,0.000181735,0.0001442815,0.00009188197,0.003772458],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01633055,"threshold_uncertainty_score":0.032471,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02134427838326024,"score_gpt":0.2448842577366756,"score_spread":0.2235399793534154,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}