{"id":"W2938806477","doi":"10.4230/lipics.icalp.2019.137","title":"Energy Consumption of Group Search on a Line","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University; Université de Sherbrooke; Carleton University; Toronto Metropolitan University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Bounded function; Line (geometry); Energy (signal processing); Computer science; Energy consumption; Constant (computer programming); Algorithm; Mathematics; Artificial intelligence; Engineering; Geometry; Electrical 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005154192,0.0005487436,0.0007431697,0.0004423101,0.0005375581,0.0009437447,0.001168021,0.001167604,0.004073307],"category_scores_gemma":[0.002368579,0.0002706161,0.0004163671,0.000790009,0.0006599007,0.001562687,0.0008636918,0.0004176045,0.0003873686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009943628,"about_ca_system_score_gemma":0.0004271483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002401037,"about_ca_topic_score_gemma":0.001400434,"domain_scores_codex":[0.9995442,0.0001369783,0.00001467135,0.00007818293,0.00008998525,0.000135978],"domain_scores_gemma":[0.9990466,0.0006016262,0.0001055543,0.0000915218,0.0000818011,0.00007281906],"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.0005712793,0.0000903068,0.0009713257,0.00007052733,0.00003857049,0.0001384738,0.00006607534,0.9754136,0.003370584,0.005007071,0.0006933938,0.01356869],"study_design_scores_gemma":[0.00002742262,0.0001696646,0.000432316,0.000004918049,0.00001020524,0.00004214434,0.00007135585,0.9945147,0.0008136041,0.003586672,0.0003199006,0.000007067423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8144142,0.0007690965,0.1674478,0.000631067,0.00005551905,0.00009835783,0.0002704388,0.0002774666,0.01603601],"genre_scores_gemma":[0.9842881,0.0001173277,0.01318979,0.00003404542,0.000006470887,0.00006187907,0.00009943624,0.00002891156,0.002174027],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004073307,"threshold_uncertainty_score":0.01362652,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0508811777326043,"score_gpt":0.3048376562969378,"score_spread":0.2539564785643335,"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."}}