{"id":"W1759574848","doi":"10.1007/978-3-642-31104-8_25","title":"Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Bounded function; Computer science; Node (physics); Tree (set theory); Upper and lower bounds; Randomized algorithm; Degree (music); Constant (computer programming); Tree traversal; Time complexity; Algorithm; Deterministic algorithm; Combinatorics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004854632,0.0007658898,0.002048067,0.001320099,0.00254704,0.005595404,0.003073286,0.002161922,0.01224581],"category_scores_gemma":[0.03378466,0.001119476,0.001748486,0.001725687,0.003987853,0.013125,0.003320109,0.003991345,0.001333568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002750965,"about_ca_system_score_gemma":0.003045946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001733556,"about_ca_topic_score_gemma":0.001785153,"domain_scores_codex":[0.9944724,0.001714312,0.0003229387,0.001363789,0.001066418,0.001060161],"domain_scores_gemma":[0.9618683,0.02720848,0.002104344,0.005929858,0.001312973,0.001575992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009069118,0.00005827389,0.000844914,0.000232282,0.00008134255,0.000113073,0.0004620086,0.05336443,0.002173539,0.9134886,0.005613212,0.02266142],"study_design_scores_gemma":[0.00008353354,0.0000703882,0.0002613416,0.0000413839,0.00005146524,0.0001151029,0.00009071511,0.117163,0.001524698,0.8778387,0.002718511,0.00004115704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.266131,0.003505687,0.6573234,0.005683139,0.0007324308,0.0002226304,0.001374402,0.002600939,0.0624264],"genre_scores_gemma":[0.9388673,0.0009643112,0.0413097,0.0003437517,0.0005194543,0.0002309149,0.0004872149,0.0009504792,0.01632682],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01224581,"threshold_uncertainty_score":0.04096627,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01536132282550642,"score_gpt":0.2434835268007695,"score_spread":0.2281222039752631,"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."}}