{"id":"W2947858290","doi":"10.1109/tase.2019.2908762","title":"Solving the Tree-Structured Task Allocation Problem via Group Multirole Assignment","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"ca_institutions":"Nipissing University","funders":"Science and Technology Planning Project of Guangdong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Task (project management); Assignment problem; Tree (set theory); Computer science; Mathematical optimization; Resource allocation; Generalized assignment problem; Optimization problem; Mathematics; Algorithm; Engineering","routes":{"ca_aff":true,"ca_fund":true,"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.0006287671,0.0001178964,0.00008314189,0.0002058223,0.0003716634,0.0002881817,0.0004552274,0.00002957165,0.000003691831],"category_scores_gemma":[0.000004381743,0.00008743739,0.00003153992,0.0007000814,0.00004538701,0.0001915721,0.00001077956,0.0001279481,0.00002206589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001080379,"about_ca_system_score_gemma":0.0000240822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001527881,"about_ca_topic_score_gemma":0.000003024102,"domain_scores_codex":[0.9987312,0.00001756198,0.0001737382,0.0003329013,0.0005095574,0.0002350406],"domain_scores_gemma":[0.9994342,0.0000590942,0.00005362897,0.0003401154,0.00005036488,0.0000625439],"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":[9.197435e-7,0.00001974223,0.000006330555,0.00001660631,0.00000745925,3.136117e-7,0.001007761,0.764697,0.05827352,0.0006616013,0.000008910342,0.1752999],"study_design_scores_gemma":[0.0001614492,0.00004181197,0.002025385,0.00003036155,0.000004608635,0.000006878289,0.0000536095,0.9916179,0.005564972,0.00004256494,0.0003348607,0.0001155694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1391923,0.0000107792,0.8591552,0.0005244675,0.0004609843,0.0002408707,2.536823e-7,0.0002625335,0.0001526004],"genre_scores_gemma":[0.9870739,0.000002314374,0.01267795,0.0001128686,0.00001766934,0.00002394091,1.771986e-7,0.000006111795,0.00008506658],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8478817,"threshold_uncertainty_score":0.3565594,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005509376641724048,"score_gpt":0.1933676508352533,"score_spread":0.1878582741935293,"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."}}