{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005492535,0.0005013783,0.001248492,0.0006747906,0.001304453,0.001494471,0.001894104,0.001091535,0.002505022],"category_scores_gemma":[0.005420166,0.0006294657,0.0005526082,0.0006717105,0.001792425,0.001755708,0.002712721,0.0007464891,0.0002620359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009145153,"about_ca_system_score_gemma":0.0006342681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008524616,"about_ca_topic_score_gemma":0.007246266,"domain_scores_codex":[0.9994935,0.0001165902,0.00002702819,0.0001016019,0.0001231723,0.000138027],"domain_scores_gemma":[0.9977183,0.001308292,0.0002807994,0.0002526904,0.000180452,0.0002594675],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003611902,0.00003581469,0.0009006448,0.00005326874,0.0000318826,0.0002319746,0.0001648062,0.952221,0.002075632,0.03731753,0.0005554173,0.00605082],"study_design_scores_gemma":[0.00002633491,0.00001955789,0.0001393789,0.000003336198,0.000006146133,0.00001919582,0.00005041518,0.9862818,0.0004066639,0.01279178,0.0002489003,0.000006539219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6649819,0.0005435252,0.3207848,0.0006131603,0.0001128044,0.00006205658,0.0001792754,0.0003872083,0.0123353],"genre_scores_gemma":[0.9883403,0.00008350724,0.00941324,0.00002121833,0.00001265096,0.00002315292,0.00005345573,0.00003010044,0.00202248],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008524616,"threshold_uncertainty_score":0.01695001,"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."}}