{"id":"W2159041520","doi":"10.1109/tcomm.2011.081111.100300","title":"On Computation of Performance Bounds of Optimal Index Assignment","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Blackberry (Canada); McMaster University","funders":"","keywords":"Quadratic assignment problem; Mathematical optimization; Assignment problem; Heuristic; Computation; Index (typography); Computer science; Resilience (materials science); Channel (broadcasting); Weapon target assignment problem; Upper and lower bounds; Quadratic equation; Optimization problem; Algorithm; Frequency assignment; Mathematics; Telecommunications","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.007439691,0.003070235,0.002049779,0.002727365,0.001019095,0.003779163,0.001717779,0.002087638,0.005852801],"category_scores_gemma":[0.06059496,0.0007862988,0.0009529876,0.002435592,0.003140309,0.003715097,0.003161049,0.003930145,0.001408094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003360005,"about_ca_system_score_gemma":0.002518451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001701202,"about_ca_topic_score_gemma":0.001434567,"domain_scores_codex":[0.9949127,0.001876603,0.0001728689,0.000584264,0.001723867,0.0007295013],"domain_scores_gemma":[0.9529862,0.04012959,0.001483282,0.002741063,0.002004026,0.0006558178],"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.0002685001,0.00008706917,0.0005270162,0.0002075193,0.00003813352,0.00005557588,0.00014272,0.8668476,0.003852461,0.09088036,0.002569865,0.03452322],"study_design_scores_gemma":[0.0000142914,0.0000648041,0.0001697624,0.00005786652,0.00001074352,0.00002895718,0.00002927827,0.9519748,0.002702021,0.04429061,0.0006421957,0.00001463166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03294257,0.002109484,0.9431233,0.0009125654,0.0001735243,0.0000978058,0.000211431,0.0005660472,0.01986331],"genre_scores_gemma":[0.7038089,0.002652409,0.2864682,0.0005248663,0.0004853481,0.000531668,0.0007049101,0.0007765614,0.00404723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007439691,"threshold_uncertainty_score":0.03934532,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05360785198762334,"score_gpt":0.2732643919597287,"score_spread":0.2196565399721054,"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."}}