{"id":"W2566486882","doi":"10.1109/iros.2016.7759299","title":"Fast and efficient rendezvous in street networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Rendezvous; Computer science; Scheduling (production processes); Taxis; Schedule; Task (project management); Limiting; Computer network; Operations research; Distributed computing; Real-time computing; Transport engineering; Mathematical optimization; 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.0001355139,0.0000517434,0.00005139317,0.00005411485,0.00001932066,0.00007148035,0.0003117309,0.00001414847,0.00001311303],"category_scores_gemma":[0.000004832277,0.00003052896,0.000007971917,0.0001421971,0.00001844213,0.0002053887,0.0003876698,0.00002211185,0.00001562609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008713665,"about_ca_system_score_gemma":0.000003256345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002190112,"about_ca_topic_score_gemma":0.00006389192,"domain_scores_codex":[0.9994626,0.0000122997,0.00007756765,0.0002087448,0.00008213975,0.0001566153],"domain_scores_gemma":[0.99967,0.00002803151,0.00001499952,0.000246473,0.000005731163,0.00003472029],"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":[9.435333e-7,0.00002874972,0.003030285,0.000001545393,0.000002720551,0.00001710683,0.00002511289,0.0003369265,0.00001057918,0.1001336,0.002159729,0.8942527],"study_design_scores_gemma":[0.001016204,0.00007305483,0.04107939,0.00004494084,0.000002173131,0.000002788031,0.00003871537,0.9463817,0.00009360405,0.001074502,0.009920019,0.0002728615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007494643,0.00003820773,0.9822125,0.0008255944,0.0001161298,0.0000568375,9.200027e-7,0.00006745293,0.009187735],"genre_scores_gemma":[0.9866582,0.00003443611,0.01114173,0.0001610087,0.00002751787,0.000003311956,8.058553e-7,0.000002638562,0.001970313],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9791636,"threshold_uncertainty_score":0.1244935,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007626359047626582,"score_gpt":0.2022419939830503,"score_spread":0.1946156349354237,"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."}}