{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003636287,0.0005341494,0.0007808298,0.0003666263,0.0004233955,0.0009231046,0.0009945438,0.001241349,0.00353848],"category_scores_gemma":[0.002163007,0.0003378082,0.0005541782,0.0004487908,0.001004414,0.0007852165,0.0007872558,0.001158598,0.0002522909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001098853,"about_ca_system_score_gemma":0.001164658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004625055,"about_ca_topic_score_gemma":0.004972913,"domain_scores_codex":[0.999684,0.0001082912,0.00001692087,0.0000620345,0.00007454049,0.0000543201],"domain_scores_gemma":[0.9990096,0.0006481219,0.00009222425,0.00007572288,0.0001110895,0.00006322878],"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.00002369001,0.0000209579,0.0001571748,0.0000361202,0.0000122621,0.00003512651,0.00004463142,0.9680364,0.000622716,0.02326712,0.0003988293,0.007345009],"study_design_scores_gemma":[0.000009391079,0.00001007652,0.00002130406,0.000002900597,0.00000229362,0.0000065208,0.000007600741,0.9877552,0.0001346652,0.01171705,0.0003303213,0.000002642858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04544496,0.000430445,0.94387,0.0005481622,0.00006802149,0.00004806057,0.0001519436,0.0003041554,0.009134199],"genre_scores_gemma":[0.7702318,0.0002918949,0.22445,0.0001537244,0.00003664451,0.0002174353,0.0002030664,0.00005423754,0.004361271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004625055,"threshold_uncertainty_score":0.01183742,"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."}}