{"id":"W2105325410","doi":"10.1109/iccd.1993.393412","title":"A recursive technique for computing lower-bound performance of schedules","year":2002,"lang":"en","type":"article","venue":"","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; CMC Microsystems","keywords":"Computer science; Upper and lower bounds; Path (computing); Graph; Benchmark (surveying); Value (mathematics); Algorithm; Parallel computing; Mathematical optimization; Theoretical computer science; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.0005619926,0.0001465619,0.0002469595,0.0001579517,0.00009955232,0.00005665312,0.0009178683,0.0001030408,0.00001466846],"category_scores_gemma":[0.00005914798,0.00013293,0.00009137045,0.0003386195,0.00006565678,0.0003959207,0.0001577166,0.0001016832,0.00001317884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004816586,"about_ca_system_score_gemma":0.00002118348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001028431,"about_ca_topic_score_gemma":0.000001271116,"domain_scores_codex":[0.9987501,0.00005051657,0.0003853452,0.0003296626,0.0002052273,0.0002791657],"domain_scores_gemma":[0.9987129,0.0001880976,0.0002078404,0.0006092745,0.0002304441,0.0000514549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002313105,0.0003644181,0.001145932,0.000683141,0.00006329738,0.000008550815,0.001443058,0.00007287139,0.1029569,0.834721,0.009298747,0.04921897],"study_design_scores_gemma":[0.0002430903,0.0009085556,0.0000629147,0.0003070086,0.000005299442,0.00004401763,0.00002726658,0.2063699,0.7825503,0.008027961,0.001131138,0.0003225966],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02243998,0.0001247158,0.9700583,0.0001245194,0.0001293961,0.0008767765,0.000001379398,0.0004265072,0.005818413],"genre_scores_gemma":[0.5439236,0.000008771338,0.4557286,0.00004763381,0.0000266625,0.00005526741,2.467671e-7,0.000008018879,0.0002012631],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.826693,"threshold_uncertainty_score":0.542073,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03167183589489886,"score_gpt":0.2656702323390783,"score_spread":0.2339983964441794,"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."}}