{"id":"W1506514157","doi":"10.1109/wescan.1993.270559","title":"A practical method to optimize negotiable call accesses for broadband communication networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Knapsack problem; Continuous knapsack problem; Computer science; Heuristic; Mathematical optimization; Class (philosophy); Bandwidth (computing); Broadband; Mathematics; Computer network; Algorithm; Artificial intelligence; Telecommunications","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.0002012926,0.0001020438,0.0001305897,0.00004706942,0.00007713293,0.0001235017,0.0001323236,0.00008157187,0.0006675117],"category_scores_gemma":[0.0000714512,0.00009780177,0.00003425972,0.0001952451,0.000008262475,0.000201843,0.00003086839,0.0001054284,0.00003837992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000234454,"about_ca_system_score_gemma":0.000003840224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001779583,"about_ca_topic_score_gemma":0.00001809291,"domain_scores_codex":[0.9994045,0.00003751545,0.000176882,0.0001165433,0.00006460014,0.0001999271],"domain_scores_gemma":[0.9991876,0.0003677485,0.00001992064,0.0002607058,0.00006715434,0.00009687241],"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.000004705952,0.00001916346,0.00001149593,0.00001722218,0.00001713171,1.443287e-7,0.00009759164,0.8802444,0.00001440683,0.001298613,0.1150058,0.003269288],"study_design_scores_gemma":[0.000258511,0.0000192612,0.000006030411,0.00001275316,0.00001330194,0.000003766891,0.00001356779,0.8778367,0.0002424534,0.00004851164,0.1214219,0.0001232996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001131645,0.0001820083,0.9578782,0.001429713,0.00009860667,0.0003323935,0.00000184856,0.0003238145,0.03974211],"genre_scores_gemma":[0.02719576,0.0004079639,0.9679726,0.0006320264,0.00004866143,0.00009379562,0.00001627173,0.00003596838,0.003596975],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03614514,"threshold_uncertainty_score":0.7308785,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05656161070644319,"score_gpt":0.3247307835829653,"score_spread":0.2681691728765221,"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."}}