{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009189796,0.0001882258,0.0004617427,0.0001382445,0.0001348351,0.0001914021,0.0004583878,0.00004528944,4.412363e-7],"category_scores_gemma":[0.00001916727,0.000139079,0.0001029311,0.0005450768,0.00005239145,0.00005365005,0.000328648,0.0001664062,4.559064e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004247199,"about_ca_system_score_gemma":0.00003399058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002054205,"about_ca_topic_score_gemma":0.000001929088,"domain_scores_codex":[0.9980484,0.0001434171,0.0006538369,0.0002874973,0.0004989073,0.0003679866],"domain_scores_gemma":[0.9985872,0.0001958313,0.0004936878,0.0001950602,0.0003133641,0.0002148374],"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.0001655178,0.00005487887,0.0004321813,0.0002145197,0.0004099997,0.00004908826,0.0004445377,0.9719088,3.740051e-7,0.01025643,0.001946317,0.01411733],"study_design_scores_gemma":[0.001592507,0.001278359,0.0006166598,0.0005107003,0.0001283671,0.0000363834,0.000699034,0.992183,0.000001101764,0.00001665334,0.002783722,0.0001535224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01887748,0.0008720337,0.9753303,0.001931789,0.000351507,0.0006747274,0.00000129333,0.00003176853,0.001929092],"genre_scores_gemma":[0.9829209,0.0001026467,0.01456963,0.0004227095,0.001708357,0.00001094479,9.478885e-7,0.00001894233,0.0002448962],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9640434,"threshold_uncertainty_score":0.5671478,"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."}}