{"id":"W2069636537","doi":"10.1145/2576768.2598387","title":"Dynamic multi-dimensional PSO with indirect encoding for proportional fair constrained resource allocation","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Particle swarm optimization; Mathematical optimization; Encoding (memory); Curse of dimensionality; Resource allocation; Proportionally fair; Orthogonal frequency-division multiple access; Quality of service; Algorithm; Orthogonal frequency-division multiplexing; Dynamic priority scheduling; Mathematics; Channel (broadcasting); Artificial intelligence; Computer network","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.0008333125,0.0004274077,0.0004776762,0.0003420111,0.0003027127,0.0007081628,0.0006703748,0.0005621159,0.0009867051],"category_scores_gemma":[0.003090153,0.0001820922,0.0003929395,0.0003716987,0.0005391851,0.0006575656,0.0008489969,0.0008248755,0.0001197538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004443501,"about_ca_system_score_gemma":0.0006509611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001364294,"about_ca_topic_score_gemma":0.001350509,"domain_scores_codex":[0.9996265,0.0001465505,0.00001951244,0.00003701148,0.0001383785,0.00003203311],"domain_scores_gemma":[0.9994685,0.0002830513,0.00005142443,0.00007616029,0.00009422387,0.00002656756],"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.00005477923,0.0000593066,0.0007137205,0.00004004216,0.00002810128,0.00004675187,0.0000773414,0.9174094,0.00409468,0.02342813,0.0005696864,0.05347806],"study_design_scores_gemma":[0.000005634525,0.00001775778,0.0000466427,0.000002076054,0.000002566746,0.000007737667,0.000002658581,0.9981343,0.0003508385,0.001204537,0.000222869,0.000002318329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01979081,0.00009877828,0.9769289,0.0001324338,0.00004761143,0.00004892193,0.00001043388,0.0001047451,0.002837368],"genre_scores_gemma":[0.6784758,0.0001076405,0.3191928,0.00009169117,0.00003243855,0.0001742743,0.00004167401,0.00003256567,0.001851084],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001364294,"threshold_uncertainty_score":0.004407048,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02317714564806146,"score_gpt":0.2839868515226085,"score_spread":0.260809705874547,"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."}}