{"id":"W1980092883","doi":"10.1007/s11227-007-0128-2","title":"Perfect load balancing on the star interconnection network","year":2007,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Load balancing (electrical power); Star (game theory); Interconnection; Preprocessor; Tree network; Algorithm; Tree (set theory); Spanning tree; A* search algorithm; Time complexity; Distributed computing; Computer network; Mathematics; Discrete 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01313073,0.0001529942,0.000222196,0.00007754637,0.0005983755,0.0001796796,0.001026225,0.00005713526,0.0000174787],"category_scores_gemma":[0.0001722694,0.00007673888,0.0001730642,0.0004238378,0.00003935972,0.0003161731,0.0001532809,0.0006818181,0.00002344569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002101623,"about_ca_system_score_gemma":0.00005970293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000668911,"about_ca_topic_score_gemma":0.00005200784,"domain_scores_codex":[0.997831,0.0004535733,0.0006679341,0.000134834,0.000500311,0.0004123153],"domain_scores_gemma":[0.9969587,0.00197402,0.0003300389,0.0003640532,0.0003035565,0.00006967131],"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.0007839368,0.0003432375,0.01141789,0.00008494777,0.0009010204,0.0003154303,0.07649403,0.4325273,0.01248134,0.1667817,0.0789016,0.2189676],"study_design_scores_gemma":[0.001688522,0.002821564,0.01341489,0.002630952,0.0001047857,0.007708488,0.01299412,0.9162961,0.004994735,0.00658203,0.02979663,0.0009671683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5452623,0.0002463798,0.4486818,0.00120268,0.002990356,0.00008354009,6.451327e-8,0.00003196903,0.001500904],"genre_scores_gemma":[0.9948198,0.00001518415,0.001164901,0.001117947,0.002825293,2.782876e-7,6.335458e-8,0.00001132487,0.00004516342],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4837689,"threshold_uncertainty_score":0.4602281,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0161554342611766,"score_gpt":0.2315069813058925,"score_spread":0.2153515470447159,"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."}}