{"id":"W2156452360","doi":"10.1109/iccis.2006.252228","title":"Determining Optimal Polling Frequency Using a Learning Automata-based Solution to the Fractional Knapsack Problem","year":2006,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Knapsack problem; Mathematical optimization; Discretization; Learning automata; Computer science; Function (biology); Resource allocation; Polling; Mathematics; Automaton; Theoretical computer science","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.0006020352,0.0001381584,0.0001083607,0.0001681702,0.0007066155,0.0004655499,0.0004771757,0.00005638922,0.00007484143],"category_scores_gemma":[0.0000444121,0.0001074209,0.00006080933,0.0006078957,0.00002896889,0.0006354564,0.0001350956,0.0002334027,0.0000805415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001129022,"about_ca_system_score_gemma":0.0002237891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002349833,"about_ca_topic_score_gemma":0.00002967694,"domain_scores_codex":[0.9983698,0.0001313855,0.0002958948,0.0003561173,0.0004380065,0.0004087584],"domain_scores_gemma":[0.9992873,0.000105933,0.0001043657,0.0002605378,0.0001550861,0.00008675749],"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.000001863098,0.00003059789,0.0005499041,0.000005098084,0.000003801266,0.000003088009,0.0001296875,0.9850126,0.001823106,0.009345999,0.0002811922,0.002813083],"study_design_scores_gemma":[0.0002260273,0.00006389129,0.0003153364,0.00002674991,0.000003082046,0.00001485681,0.00002304031,0.9962651,0.0006082101,0.0003022453,0.001995527,0.0001559994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004613297,0.00001457945,0.9891339,0.002730563,0.0001166993,0.0002711097,0.000001137975,0.0003922924,0.002726431],"genre_scores_gemma":[0.3984522,5.498804e-7,0.6008035,0.0003549193,0.00008018968,0.00001731727,0.000006646831,0.000009649165,0.0002750111],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3938389,"threshold_uncertainty_score":0.5434787,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02764168347128186,"score_gpt":0.2759061406762344,"score_spread":0.2482644572049525,"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."}}