{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005351731,0.0001455736,0.000270884,0.0004129549,0.0001388672,0.00004952598,0.0004001783,0.0001124804,0.00001108128],"category_scores_gemma":[0.00008156121,0.0001688138,0.00009647309,0.0007492091,0.0003749456,0.0005772721,0.00006657711,0.0001576986,0.00000120954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001268725,"about_ca_system_score_gemma":0.0001019142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001687256,"about_ca_topic_score_gemma":0.0000479237,"domain_scores_codex":[0.9987098,0.00002567221,0.0003543219,0.0002230266,0.000328256,0.0003589042],"domain_scores_gemma":[0.9986227,0.00008425243,0.000291311,0.0002555643,0.0005535593,0.0001926532],"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.00004543273,0.00006035641,0.0003478674,0.00002374153,0.00003712965,0.000005615779,0.0005783893,0.9527483,0.001015916,0.002189733,0.0009555446,0.041992],"study_design_scores_gemma":[0.0006129214,0.0000754889,0.001580292,0.00008438999,0.00003404239,0.000006906581,0.004776547,0.9905429,0.001304782,0.0006233666,0.0001943893,0.0001639463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4244528,0.0001005876,0.57472,0.00007333738,0.0002345648,0.0001098649,0.00001329367,0.0001056518,0.0001898859],"genre_scores_gemma":[0.929992,0.00001516767,0.06982528,0.000003158483,0.00005670797,3.521563e-8,0.00005502432,0.0000150808,0.00003752248],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5055392,"threshold_uncertainty_score":0.6884027,"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."}}