{"id":"W2901887370","doi":"10.1007/978-3-030-04651-4_38","title":"On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Traverse; Competitive analysis; Combinatorics; Generalization; Computer science; Graph; Shortest path problem; Path (computing); Asymptotically optimal algorithm; Node (physics); Randomized algorithm; Enhanced Data Rates for GSM Evolution; Mathematics; Discrete mathematics; Mathematical optimization; Algorithm; Artificial intelligence; Upper and lower bounds; Computer network","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00164395,0.0003155031,0.00030228,0.0003977213,0.0007306521,0.0007951866,0.004031577,0.0001790595,0.0001386965],"category_scores_gemma":[0.00008992115,0.0001801239,0.0001145884,0.0004509626,0.00165533,0.0002636455,0.0003651029,0.0004639355,0.00001988187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000154286,"about_ca_system_score_gemma":0.002550693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005709793,"about_ca_topic_score_gemma":0.01383435,"domain_scores_codex":[0.9975604,0.00005793558,0.0003592309,0.0007442654,0.0007578859,0.0005202569],"domain_scores_gemma":[0.9962112,0.001739949,0.000211588,0.001083864,0.0006001116,0.0001532351],"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.000006569636,0.00001612626,0.000002980237,0.00003866396,0.00001785381,0.000003115869,0.002368236,0.09541656,0.00001505805,0.8527099,0.0001107604,0.04929412],"study_design_scores_gemma":[0.0001894965,0.0002518976,0.0000312009,0.0002886578,0.000005261529,0.000006608299,0.000003343234,0.5646193,0.0004440818,0.4295351,0.004336084,0.0002890213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00001090072,0.00007330733,0.9813331,0.005549769,0.0006135269,0.001154403,0.00001385269,0.00003122548,0.0112199],"genre_scores_gemma":[0.5228952,0.0001047942,0.4593491,0.01341684,0.0008259317,0.0002145036,0.00001522884,0.0001111325,0.00306732],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5228842,"threshold_uncertainty_score":0.7719892,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03387326969170144,"score_gpt":0.2618579579136054,"score_spread":0.227984688221904,"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."}}