{"id":"W2152005431","doi":"10.1109/12.862220","title":"Continuous learning automata solutions to the capacity assignment problem","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"semigroups and automata theory","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network packet; Computer science; Heuristic; Simulated annealing; Automaton; Learning automata; Set (abstract data type); Mathematical optimization; Class (philosophy); Assignment problem; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.0004251467,0.0002069486,0.0001792841,0.0001115769,0.0008608213,0.0002822262,0.001035566,0.00005796775,0.0001156383],"category_scores_gemma":[0.000002028346,0.0001624002,0.0001222692,0.0005881494,0.00006335358,0.0002971379,0.000008626394,0.0003687377,0.0006707277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001062514,"about_ca_system_score_gemma":0.00004418847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008757124,"about_ca_topic_score_gemma":0.00001691074,"domain_scores_codex":[0.9982569,0.000209657,0.0002563249,0.0004628752,0.0003446393,0.0004696067],"domain_scores_gemma":[0.998853,0.0002075046,0.00004819894,0.0006879341,0.00004383659,0.0001595853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007547553,0.0001648149,0.000001566177,0.000003580487,0.00003847592,0.000005360863,0.001303542,0.4656299,0.0002379421,0.001541073,0.003076217,0.52799],"study_design_scores_gemma":[0.0006023038,0.0004555811,0.0002243889,0.0001054606,0.00002569651,0.0001102332,0.00008130094,0.9340823,0.001915858,0.0006573726,0.06125674,0.0004827111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00683424,0.00001155686,0.9854761,0.004696338,0.0008038623,0.0003636419,0.00000868964,0.0008025006,0.001003078],"genre_scores_gemma":[0.9526874,0.00001625624,0.04443141,0.00172113,0.0000681624,0.00008620055,0.000001077452,0.00001774272,0.0009706391],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9458531,"threshold_uncertainty_score":0.8621072,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01753760132844699,"score_gpt":0.2125178869210948,"score_spread":0.1949802855926479,"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."}}