{"id":"W2483254871","doi":"","title":"An optimal station allocation policy for tree Local Area Networks","year":2015,"lang":"en","type":"article","venue":"Hrčak Portal of scientific journals of Croatia (University Computing Centre)","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"PricewaterhouseCoopers (Canada)","funders":"","keywords":"Heuristic; Subgradient method; Computer science; Tree (set theory); Mathematical optimization; Network topology; Relaxation (psychology); Local area network; Optimization problem; Facility location problem; Tree network; Distributed computing; Computer network; Mathematics; Time complexity; Algorithm","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.0008732025,0.0003704775,0.0006297499,0.0005835815,0.000561596,0.0007167264,0.0007179774,0.0007670274,0.003424702],"category_scores_gemma":[0.002621907,0.0002529819,0.0003190716,0.0008246648,0.0006415867,0.0008970786,0.0005184591,0.0005022261,0.0002661009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001345492,"about_ca_system_score_gemma":0.001429358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005657121,"about_ca_topic_score_gemma":0.005764795,"domain_scores_codex":[0.9995578,0.0001865465,0.000009690423,0.00004627021,0.00006491529,0.0001347469],"domain_scores_gemma":[0.9990664,0.0006174897,0.000107641,0.00004075148,0.00008411986,0.00008365905],"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.00007796629,0.00004347775,0.0002195635,0.00002641458,0.000008364589,0.00002562317,0.00002666294,0.9860095,0.0007605224,0.005864363,0.0005752918,0.006362243],"study_design_scores_gemma":[0.00001721189,0.00004445166,0.0000872061,0.000003667674,0.00000416131,0.000009872556,0.00003029568,0.9968611,0.0002751405,0.002270083,0.0003937337,0.000003090852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.371577,0.0005703656,0.6063109,0.0003885731,0.00007693956,0.0003025592,0.0003185649,0.000469367,0.01998569],"genre_scores_gemma":[0.927316,0.0001944819,0.07057462,0.0000559661,0.000007835663,0.0001186629,0.0001027681,0.0000314734,0.001598148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005657121,"threshold_uncertainty_score":0.01145679,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02365470208788648,"score_gpt":0.2515065472719688,"score_spread":0.2278518451840823,"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."}}