{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002560363,0.00263529,0.004274935,0.002199674,0.003387004,0.007402334,0.005286973,0.004149227,0.03453679],"category_scores_gemma":[0.02252632,0.0009272705,0.002035117,0.004056296,0.004756692,0.008924196,0.004155938,0.006101222,0.002011473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005622358,"about_ca_system_score_gemma":0.008166195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03182654,"about_ca_topic_score_gemma":0.02211505,"domain_scores_codex":[0.9977626,0.0006734296,0.00008534737,0.0003658535,0.0003572665,0.0007554828],"domain_scores_gemma":[0.9848241,0.01114422,0.0007019363,0.0007421667,0.0007955281,0.001792196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009861543,0.0002595185,0.001005641,0.0004909668,0.0001151811,0.00017058,0.0005629134,0.1182337,0.001153917,0.8240639,0.02553898,0.02741852],"study_design_scores_gemma":[0.0001870787,0.0001282929,0.0004740803,0.000105511,0.00005814411,0.00008471697,0.0003390332,0.1861847,0.0003396214,0.8071673,0.004868205,0.00006342262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.4420215,0.005349067,0.2116147,0.009979992,0.0007509615,0.0005814256,0.0025521,0.001003168,0.3261471],"genre_scores_gemma":[0.8988844,0.003502421,0.04216091,0.001053683,0.0005610493,0.0005563085,0.001939069,0.000762166,0.05057989],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.03453679,"threshold_uncertainty_score":0.115537,"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."}}