{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001387324,0.0003833805,0.0006666383,0.001266967,0.00009428817,0.0001875973,0.002187913,0.000314082,0.00006935555],"category_scores_gemma":[0.0001306699,0.0003527464,0.0001139717,0.0007890783,0.0005715144,0.0007502462,0.0007455831,0.0004994958,0.00004893966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001859358,"about_ca_system_score_gemma":0.0004671371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001379415,"about_ca_topic_score_gemma":0.0000569833,"domain_scores_codex":[0.9967542,0.00009474171,0.0007474991,0.0009104851,0.0008844688,0.0006085723],"domain_scores_gemma":[0.997826,0.0004576271,0.0003767651,0.001001865,0.0001764508,0.0001612736],"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.00005074974,0.00009537383,0.00009258899,0.00005197297,0.000009940308,0.00004549134,0.003628734,0.1668166,0.0002660056,0.004038044,0.00002208241,0.8248824],"study_design_scores_gemma":[0.001652997,0.0001961135,0.0001394908,0.0003187319,0.000005602186,0.00003901102,1.559233e-7,0.9789563,0.0009118318,0.01685557,0.0004307702,0.0004934576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008287808,0.0003749037,0.994953,0.0003065715,0.0005353199,0.0005365445,0.000004157058,0.00008447054,0.00312212],"genre_scores_gemma":[0.382278,0.0003759857,0.6135915,0.001360966,0.0003912341,0.00002814644,0.00002090284,0.00007951549,0.001873792],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8243889,"threshold_uncertainty_score":0.9998925,"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."}}