{"id":"W2762426729","doi":"10.1007/978-3-319-73117-9_27","title":"Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Robot; Traverse; Computer science; Graph; Mobile robot; A priori and a posteriori; Time complexity; Node (physics); Enhanced Data Rates for GSM Evolution; Adversary; Theoretical computer science; Algorithm; Artificial intelligence","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.0005959818,0.0003656109,0.0005025297,0.0008032279,0.0006009459,0.0006185848,0.002544234,0.0001520564,0.00007915751],"category_scores_gemma":[0.00005688211,0.0003171654,0.00008474446,0.0006231588,0.00162881,0.001074864,0.0006371838,0.0005112812,0.00002477766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001238696,"about_ca_system_score_gemma":0.0007345516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003239102,"about_ca_topic_score_gemma":0.00002789382,"domain_scores_codex":[0.9971383,0.0000292556,0.0004115524,0.001033791,0.0008574436,0.0005296387],"domain_scores_gemma":[0.997416,0.000281437,0.0003700761,0.001314354,0.0004287024,0.0001894863],"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.00001509869,0.0001336769,0.00004245212,0.00009217574,0.00005705291,0.00005437768,0.0015849,0.65583,0.0007574825,0.0156148,0.0007159993,0.325102],"study_design_scores_gemma":[0.001148436,0.001261887,0.00001771614,0.001614236,0.00001985603,0.0001284975,9.586649e-7,0.9354051,0.007150867,0.04691045,0.004959199,0.001382818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002419104,0.0001306395,0.9812869,0.0001564946,0.0005315101,0.0005393135,0.00001437109,0.0001104202,0.01720619],"genre_scores_gemma":[0.05337607,0.0004843549,0.9318122,0.0004565835,0.0001387485,0.0001473988,0.0000220248,0.00008548845,0.01347711],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3237191,"threshold_uncertainty_score":0.9999281,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03790816574046223,"score_gpt":0.2490121587925893,"score_spread":0.2111039930521271,"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."}}