{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00136533,0.00164879,0.001033283,0.0007388273,0.0008853931,0.001474434,0.001170734,0.001836183,0.0114977],"category_scores_gemma":[0.003874872,0.001045539,0.001141303,0.001332288,0.001065582,0.001394295,0.001452288,0.002168149,0.001850513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009064354,"about_ca_system_score_gemma":0.001691516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002452636,"about_ca_topic_score_gemma":0.003014238,"domain_scores_codex":[0.9991923,0.0002883135,0.00003005867,0.0001140904,0.0003041857,0.00007106386],"domain_scores_gemma":[0.9993067,0.0004434199,0.00004748261,0.00009285168,0.00008428223,0.00002516511],"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.00004056368,0.00007864757,0.0001664297,0.0001959158,0.0000435008,0.00006085242,0.00007464339,0.7351975,0.002063214,0.1176611,0.00843581,0.1359818],"study_design_scores_gemma":[0.00003218364,0.00004767765,0.00004405246,0.00001858851,0.00001082357,0.00005215026,0.00001755447,0.939372,0.0006661134,0.05069985,0.009028227,0.00001071498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009485162,0.0001188446,0.9945596,0.0001398448,0.00005483707,0.00005370631,0.00003017309,0.0001533539,0.003941224],"genre_scores_gemma":[0.06707594,0.0004230258,0.9244886,0.0001302973,0.0001050131,0.0004832779,0.0001414177,0.0002230867,0.006929426],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0114977,"threshold_uncertainty_score":0.03846365,"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."}}