{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001844604,0.001894766,0.0009600949,0.003202525,0.0006952338,0.00116223,0.001723867,0.0009562201,0.00453625],"category_scores_gemma":[0.01538217,0.0009433995,0.00137644,0.001637891,0.001248801,0.001845376,0.0009106238,0.002143702,0.002246113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001733156,"about_ca_system_score_gemma":0.002494431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01047181,"about_ca_topic_score_gemma":0.01039336,"domain_scores_codex":[0.9977189,0.0004831852,0.0001092809,0.0004379483,0.0009777993,0.000272825],"domain_scores_gemma":[0.9929947,0.004054939,0.0008060568,0.001124512,0.0009193526,0.0001005156],"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.0002241512,0.0001325855,0.002742486,0.0002752287,0.0001262556,0.000112538,0.0002948829,0.4990393,0.04350556,0.03763888,0.004122372,0.4117858],"study_design_scores_gemma":[0.00002141377,0.0001257936,0.000844321,0.00003213672,0.00003016873,0.0000833098,0.00001746595,0.9715006,0.01804263,0.006723576,0.002534483,0.00004397275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006039976,0.00007838062,0.9904121,0.00003482639,0.00001411942,0.00007232103,0.00006806813,0.00207635,0.001203782],"genre_scores_gemma":[0.133735,0.0001308205,0.862931,0.00005591413,0.00004149431,0.0004085439,0.0003856458,0.0007921715,0.00151945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01047181,"threshold_uncertainty_score":0.02082175,"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."}}