{"id":"W2092863347","doi":"10.1007/s00224-011-9379-7","title":"Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains","year":2011,"lang":"en","type":"article","venue":"Theory of Computing Systems","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":"","keywords":"Rendezvous; Terrain; Asynchronous communication; Polygon (computer graphics); Computer science; Bounded function; Trajectory; Point (geometry); Algorithm; Mathematics; Geometry; Geography; Frame (networking); Mathematical analysis; Engineering","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":[],"consensus_categories":[],"category_scores_codex":[0.001670264,0.0001393138,0.0003505159,0.000269358,0.00006250358,0.00003336897,0.0008898957,0.0000658962,0.00001951799],"category_scores_gemma":[0.00005826415,0.0001348565,0.00006694516,0.0003373768,0.000176572,0.0001307166,0.0002400123,0.000122932,0.00001178705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005021862,"about_ca_system_score_gemma":0.0001325146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001264567,"about_ca_topic_score_gemma":0.000004993771,"domain_scores_codex":[0.9979378,0.0005015262,0.000669351,0.0002717982,0.0003151942,0.0003043121],"domain_scores_gemma":[0.9987611,0.000214319,0.0003636722,0.000481952,0.00009933132,0.00007961873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001043252,0.0008810199,0.005007236,0.0009909216,0.0001301088,0.0001008856,0.07086395,0.02114795,0.000840821,0.8429458,0.0001411619,0.05684585],"study_design_scores_gemma":[0.001881381,0.0007761744,0.02195857,0.001121909,0.00001623291,0.0001622702,0.001172384,0.9459904,0.001208019,0.02505346,0.00007344026,0.0005857204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2310344,0.0001799111,0.7364399,0.00001296427,0.0006412656,0.0003736632,0.000003836176,0.0001086616,0.03120531],"genre_scores_gemma":[0.9872465,0.000002603007,0.01249904,0.00002938769,0.0000310566,0.00000317235,0.000001367266,0.00001187233,0.0001749569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9248425,"threshold_uncertainty_score":0.5499287,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06548969616562526,"score_gpt":0.2818040062851477,"score_spread":0.2163143101195225,"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."}}