{"id":"W1493636406","doi":"10.1007/978-3-642-15763-9_28","title":"Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Rendezvous; Asynchronous communication; Computer science; Traverse; Visibility; Euclidean space; Grid; Position (finance); Upper and lower bounds; Dimension (graph theory); Trajectory; RADIUS; Euclidean distance; Algorithm; Topology (electrical circuits); Discrete mathematics; Theoretical computer science; Combinatorics; Mathematics; Geometry; Artificial intelligence; Spacecraft; Mathematical analysis","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.001259775,0.0005853934,0.0005695695,0.001411623,0.0002820418,0.0004835854,0.002961729,0.0005729771,0.0001061571],"category_scores_gemma":[0.0001631953,0.0005519023,0.0001233162,0.0009124369,0.0008812892,0.0007837472,0.001957457,0.002113605,0.0001187267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003041387,"about_ca_system_score_gemma":0.001176595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004490022,"about_ca_topic_score_gemma":0.0002179135,"domain_scores_codex":[0.9952202,0.00006096748,0.0007181956,0.00173983,0.001315014,0.0009457296],"domain_scores_gemma":[0.9971868,0.0005216413,0.0002572014,0.001396758,0.0003374371,0.0003001053],"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.00001591461,0.000130841,0.0001984888,0.0000406207,0.00001244157,0.0004454556,0.00160214,0.491669,0.0007069412,0.03554296,0.00002491674,0.4696102],"study_design_scores_gemma":[0.0006463666,0.0002299573,0.0002514995,0.0002745427,0.000002862052,0.0001498081,1.511164e-7,0.9730163,0.0009941882,0.01830184,0.005302721,0.0008298029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002648079,0.0001794644,0.9932141,0.0009261692,0.001804723,0.0004888502,0.00000751094,0.0001667565,0.002947652],"genre_scores_gemma":[0.04128716,0.0000746267,0.9562188,0.001592229,0.0003297707,0.00001633929,0.00001759061,0.00004611922,0.0004173744],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4813472,"threshold_uncertainty_score":0.9996933,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01574144675944542,"score_gpt":0.252601312417252,"score_spread":0.2368598656578066,"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."}}