{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357527,0.0008268504,0.0009328924,0.0006240812,0.00064758,0.001415648,0.00162583,0.001583259,0.005158228],"category_scores_gemma":[0.003282793,0.0004324033,0.0008410921,0.0007365015,0.001427187,0.001111341,0.001292607,0.001753554,0.000604961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001081865,"about_ca_system_score_gemma":0.001453167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002743382,"about_ca_topic_score_gemma":0.003428462,"domain_scores_codex":[0.999455,0.000170682,0.00003688547,0.0001456108,0.0001151138,0.00007669652],"domain_scores_gemma":[0.9976739,0.001685198,0.0001218884,0.0001963469,0.0002178365,0.0001047667],"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.00009576975,0.00008697104,0.0003384099,0.0001786158,0.00004099736,0.000113794,0.0001816772,0.8169832,0.001683957,0.1275315,0.001979537,0.05078562],"study_design_scores_gemma":[0.00002009637,0.00002135753,0.0000332042,0.000007401703,0.000005552043,0.00001529967,0.00001763766,0.9511563,0.0004162782,0.04734706,0.0009529743,0.000006767744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02541015,0.0005079554,0.963569,0.0003917578,0.00009394094,0.0000609647,0.0001164503,0.0004838906,0.009365875],"genre_scores_gemma":[0.5970802,0.0007009833,0.3916563,0.0001569226,0.0001218163,0.000400493,0.0003626301,0.0001306701,0.009389971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005158228,"threshold_uncertainty_score":0.01725596,"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."}}