{"id":"W2144303191","doi":"10.1109/tsmcb.2002.1049616","title":"Discretized learning automata solutions to the capacity assignment problem for prioritized networks","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Discretization; Learning automata; Computer science; Heuristic; Mathematical optimization; Simulated annealing; Network packet; Genetic algorithm; Set (abstract data type); Automaton; Class (philosophy); Focus (optics); Theoretical computer science; Artificial intelligence; Algorithm; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000907991,0.0003823698,0.0004081225,0.00017276,0.001122767,0.0008162049,0.000733756,0.0001861101,0.00004973317],"category_scores_gemma":[0.00001937645,0.0003138464,0.0001667041,0.0005046235,0.0001528228,0.0001966979,0.00002804487,0.0005155196,0.0001031464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001170866,"about_ca_system_score_gemma":0.00003265917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008845381,"about_ca_topic_score_gemma":0.00008907149,"domain_scores_codex":[0.9966773,0.0004394815,0.0006806279,0.000755519,0.0006081501,0.0008388796],"domain_scores_gemma":[0.9980123,0.0003639475,0.0001820796,0.0007990639,0.0002131364,0.0004294663],"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.00003218472,0.0004127129,0.00002103077,0.00009230118,0.0001478002,0.000003321944,0.003143012,0.9399972,0.0001113108,0.02797484,0.008476302,0.01958797],"study_design_scores_gemma":[0.001243656,0.0004092117,0.0000390984,0.0001433218,0.0000502349,0.00002554574,0.0001266905,0.9148915,0.00008224315,0.0001871216,0.08239583,0.0004055515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005196766,0.0002349586,0.9895129,0.003929817,0.00100735,0.002371665,0.00003555299,0.0003713347,0.002016721],"genre_scores_gemma":[0.9655488,0.0007414499,0.01317216,0.0003638359,0.0001914454,0.001073868,0.000007447572,0.00006048917,0.01884058],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9763408,"threshold_uncertainty_score":0.9999313,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0454457620888802,"score_gpt":0.2420596521682427,"score_spread":0.1966138900793625,"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."}}