{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001001986,0.0001370348,0.0001629277,0.0001930385,0.0002179189,0.0001353373,0.0004352057,0.00005496332,0.00007453409],"category_scores_gemma":[0.0004334314,0.0001057104,0.00003984986,0.000359437,0.0001121525,0.0002520765,0.0001028615,0.0001070731,0.00002581911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006136496,"about_ca_system_score_gemma":0.0002460503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005415866,"about_ca_topic_score_gemma":0.00001177142,"domain_scores_codex":[0.9982526,0.0001109367,0.0002796963,0.0004751385,0.0005877967,0.0002938762],"domain_scores_gemma":[0.9986224,0.0003704701,0.0001205277,0.0003435564,0.0004067253,0.0001363577],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002784953,0.001302544,0.001808264,0.000276405,0.0003478438,0.00002550178,0.001107801,0.2479722,0.0102323,0.5067377,0.006170035,0.2237409],"study_design_scores_gemma":[0.0009239771,0.0001352126,0.0007282734,0.00001516911,0.000004682996,0.00002630583,0.00001460571,0.995139,0.0008383421,0.0002997707,0.001716601,0.000158078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00095125,0.00000645258,0.9945601,0.001617965,0.00006705045,0.0005571632,0.000004474004,0.0001931521,0.002042402],"genre_scores_gemma":[0.2357012,5.847044e-7,0.7615902,0.0002133694,0.00002107512,0.00007693181,0.00004932581,0.00001162885,0.002335685],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7471668,"threshold_uncertainty_score":0.4310745,"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."}}