{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004547057,0.0005172217,0.001142673,0.0004408213,0.0007042123,0.001093237,0.001089183,0.0006554555,0.004809201],"category_scores_gemma":[0.003296241,0.0004499322,0.0003769326,0.0006042208,0.001170561,0.001879853,0.002258877,0.001065703,0.0004774404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005863234,"about_ca_system_score_gemma":0.0003541845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001203689,"about_ca_topic_score_gemma":0.001055621,"domain_scores_codex":[0.9996065,0.0001306969,0.00002075394,0.00006544435,0.0001052918,0.0000713102],"domain_scores_gemma":[0.9985979,0.0008648768,0.00009458898,0.0002501911,0.00008193757,0.0001105269],"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.000519903,0.00005366731,0.0003282533,0.0001480422,0.00003421082,0.0001181318,0.0001654012,0.542989,0.008283047,0.4166321,0.003028979,0.02769926],"study_design_scores_gemma":[0.00003963367,0.00002465146,0.00007575817,0.000009555287,0.000005093573,0.00002976757,0.00004759109,0.8430073,0.001174639,0.1546797,0.0008959373,0.00001045136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2358287,0.0009743692,0.7235356,0.0005743661,0.0002534458,0.00005957728,0.0002166523,0.0007071533,0.03785018],"genre_scores_gemma":[0.9368699,0.0003862585,0.05210736,0.00007117615,0.00006308528,0.00007614633,0.0001354512,0.0001836362,0.01010701],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004809201,"threshold_uncertainty_score":0.01608837,"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."}}