{"id":"W2057121017","doi":"10.1007/s00446-013-0201-4","title":"Time versus space trade-offs for rendezvous in trees","year":2013,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Rendezvous; Node (physics); Logarithm; Tree (set theory); Constant (computer programming); Computer science; Binary logarithm; Task (project management); Combinatorics; Line (geometry); Mathematics; Discrete mathematics; Algorithm; Physics; Geometry","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.002857473,0.000638641,0.001668441,0.001298947,0.001605822,0.002147147,0.001601529,0.001587469,0.008881876],"category_scores_gemma":[0.02156791,0.000490721,0.0005616136,0.001655159,0.001928272,0.004234365,0.001946159,0.001202703,0.0007010217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001525065,"about_ca_system_score_gemma":0.0009370204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002451922,"about_ca_topic_score_gemma":0.003991719,"domain_scores_codex":[0.9985093,0.0005189377,0.00006538162,0.0001885255,0.0002651658,0.0004526255],"domain_scores_gemma":[0.980759,0.01601772,0.0005801263,0.001147327,0.000664905,0.0008309347],"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.002107419,0.0002148242,0.001784782,0.0002484075,0.00007322232,0.0001144368,0.0005799299,0.7993042,0.0100669,0.1053147,0.003496288,0.07669482],"study_design_scores_gemma":[0.0001074148,0.0002618906,0.0006395272,0.00002752864,0.00005116947,0.00008814048,0.0003795332,0.8809496,0.003448522,0.1129342,0.001084636,0.00002785184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7196363,0.002947289,0.2552141,0.001523829,0.0001187546,0.0001171572,0.0003409421,0.0007998146,0.01930177],"genre_scores_gemma":[0.9783417,0.0003179409,0.01858379,0.00004242997,0.00003211021,0.00003708609,0.00006077228,0.0001768787,0.002407359],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008881876,"threshold_uncertainty_score":0.0297128,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02343529895674592,"score_gpt":0.2642404078515405,"score_spread":0.2408051088947945,"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."}}