{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001069172,0.0005302877,0.0007651745,0.0007230281,0.0001615971,0.0004973607,0.002267233,0.0005134427,0.00007245725],"category_scores_gemma":[0.00005992051,0.0004885305,0.0004023895,0.000292863,0.0001486894,0.0008176834,0.002243206,0.0009740186,0.0001937959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001823349,"about_ca_system_score_gemma":0.0002478774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004166994,"about_ca_topic_score_gemma":0.000009759972,"domain_scores_codex":[0.9959717,0.0001243429,0.001517494,0.0005304087,0.001096787,0.0007592737],"domain_scores_gemma":[0.9963047,0.0002514225,0.0007645016,0.001767833,0.0006625253,0.0002489974],"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.0008080562,0.003476573,0.004498803,0.01415048,0.001328397,0.0000153969,0.021759,0.4345577,0.0002066618,0.3603668,0.03225369,0.1265784],"study_design_scores_gemma":[0.002209059,0.0006699414,0.000112342,0.0006808784,0.00001806432,0.00001042658,0.0000834215,0.9669843,0.0009681861,0.0008926356,0.02681005,0.0005606852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00854307,0.00007129202,0.9819118,0.0006863113,0.001620907,0.001629053,0.0006661121,0.0002378348,0.004633651],"genre_scores_gemma":[0.8563878,0.001355034,0.1306074,0.005131693,0.0002326086,0.0004203214,0.003936964,0.000135881,0.00179236],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8513044,"threshold_uncertainty_score":0.9997566,"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."}}