{"id":"W2171315559","doi":"10.1109/mpcs.1994.367032","title":"A fast algorithm for data exchange in reconfigurable tree structures","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Tree (set theory); Algorithm; Node (physics); Time complexity; Table (database); Data structure; Feature (linguistics); Routing table; Tree structure; Data exchange; Sequence (biology); Routing (electronic design automation); Theoretical computer science; Parallel computing; Binary tree; Mathematics; Data mining; Computer network; Routing protocol","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.0007229925,0.0009058736,0.0007034758,0.001079812,0.001106143,0.001582554,0.001947575,0.001105053,0.00579799],"category_scores_gemma":[0.001946873,0.0005860863,0.0007825606,0.001459376,0.0008406434,0.002482661,0.001469472,0.001212926,0.002072839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00110945,"about_ca_system_score_gemma":0.001625882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002947879,"about_ca_topic_score_gemma":0.00249796,"domain_scores_codex":[0.9991166,0.0001460905,0.00007499661,0.0001830972,0.00033475,0.0001443698],"domain_scores_gemma":[0.9991927,0.0003720989,0.0000748926,0.0001483886,0.0001738063,0.00003817178],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005100712,0.0001397074,0.000609378,0.0003526009,0.00007631157,0.0002672158,0.0003074132,0.1439773,0.02564297,0.06906249,0.01397662,0.7450779],"study_design_scores_gemma":[0.0003883922,0.0002907651,0.0003021587,0.00009231672,0.00005291237,0.0003960466,0.0001071749,0.8550738,0.02479228,0.06862779,0.04978865,0.00008779109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003370952,0.0001455926,0.9930527,0.00008057691,0.00004478326,0.00008594767,0.00005505437,0.001637558,0.001526955],"genre_scores_gemma":[0.0402829,0.0001299619,0.9563656,0.00005859736,0.00002687251,0.0002261053,0.0002831802,0.0002491467,0.002377604],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00579799,"threshold_uncertainty_score":0.01939619,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07497217069477873,"score_gpt":0.2672321350796171,"score_spread":0.1922599643848383,"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."}}