{"id":"W2161536662","doi":"10.1007/978-3-642-13284-1_12","title":"Distributed Tree Comparison with Nodes of Limited Memory","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Asynchronous communication; Tree (set theory); Task (project management); Automaton; Class (philosophy); Theoretical computer science; Distributed algorithm; Timed automaton; Enhanced Data Rates for GSM Evolution; Shared memory; Parallel computing; State (computer science); Distributed memory; Discrete mathematics; Distributed computing; Algorithm; Combinatorics; Mathematics; Computer network; Artificial intelligence","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.001743982,0.0004273568,0.001349293,0.001382798,0.000771039,0.001319679,0.002438807,0.0009546089,0.009917608],"category_scores_gemma":[0.0109117,0.000274941,0.0003600204,0.002108077,0.0005414274,0.004167728,0.001691588,0.000717724,0.0008080759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009777928,"about_ca_system_score_gemma":0.00106567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006154821,"about_ca_topic_score_gemma":0.001401424,"domain_scores_codex":[0.9989377,0.0003238991,0.00006647597,0.0001679776,0.0003965473,0.0001074368],"domain_scores_gemma":[0.9938315,0.003194931,0.0002235756,0.001529163,0.0009698011,0.0002509792],"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.007785852,0.0003830135,0.003477592,0.000771668,0.0002606983,0.0003390807,0.0003488944,0.1798939,0.02979642,0.1272997,0.02154974,0.6280936],"study_design_scores_gemma":[0.0004466839,0.0006845929,0.001339661,0.0000983522,0.0001781246,0.0003445634,0.0001212372,0.794934,0.02032498,0.1701856,0.01130471,0.00003745595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2884206,0.005060222,0.6746379,0.001273598,0.001130554,0.0002136644,0.0008812795,0.003273731,0.02510851],"genre_scores_gemma":[0.7570807,0.0005129808,0.2323332,0.0001716841,0.0002984664,0.0001398235,0.0006517218,0.0004332976,0.008378152],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009917608,"threshold_uncertainty_score":0.03317773,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0146414705828723,"score_gpt":0.2375666501503124,"score_spread":0.2229251795674401,"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."}}