{"id":"W2129832837","doi":"10.1109/ispa.2008.127","title":"Computation with Energy-Time Trade-Offs: Models, Algorithms and Lower-Bounds","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computation; Sorting; Energy consumption; Energy (signal processing); Simple (philosophy); Parallel computing; Multiplication (music); Algorithm; Power (physics); Model of computation; Upper and lower bounds; Computer engineering; Mathematics; 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":[],"consensus_categories":[],"category_scores_codex":[0.00009091011,0.0001413485,0.000148939,0.0001031805,0.0002259357,0.00010718,0.0002700944,0.00005461303,0.000003422165],"category_scores_gemma":[0.000002236027,0.0001147577,0.00002465555,0.0002925917,0.00007778017,0.000514549,0.00008899097,0.00006408715,0.000003782071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001954499,"about_ca_system_score_gemma":0.00005373002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004433125,"about_ca_topic_score_gemma":0.000001652311,"domain_scores_codex":[0.9990419,0.00003916355,0.0001616449,0.0003473245,0.0002222021,0.0001877506],"domain_scores_gemma":[0.9995422,0.00004313751,0.00006034334,0.0002123508,0.0000527402,0.00008927738],"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.00005522982,0.000581529,0.000264952,0.00002454729,0.0001155753,0.0002100724,0.002941157,0.5713622,0.0001786513,0.1771561,0.03860443,0.2085056],"study_design_scores_gemma":[0.0002498945,0.0001833073,0.0001166929,0.000009742436,0.000002288891,0.0001638959,0.000002708187,0.9940868,0.0002917043,0.004173434,0.0005346688,0.0001848448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001561081,0.00009922685,0.9875363,0.0004687036,0.0000388044,0.00005735303,4.983798e-7,0.000896323,0.0093417],"genre_scores_gemma":[0.4204745,0.00005931302,0.5783461,0.0003561871,0.00002321164,0.000004410752,0.000004135947,0.000008407505,0.0007237598],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4227246,"threshold_uncertainty_score":0.4679683,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01789151994368057,"score_gpt":0.2223864121818269,"score_spread":0.2044948922381464,"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."}}