{"id":"W2100720213","doi":"10.1142/s0218213008003765","title":"OPTIMAL BASIC BLOCK INSTRUCTION SCHEDULING FOR MULTIPLE-ISSUE PROCESSORS USING CONSTRAINT PROGRAMMING","year":2008,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"ca_institutions":"IBM (Canada); University of Waterloo","funders":"International Business Machines Corporation; Intel Corporation","keywords":"Computer science; Instruction scheduling; Compiler; Scheduling (production processes); Suite; Parallel computing; Optimizing compiler; Constraint programming; Schedule; Algorithm; Mathematical optimization; Dynamic priority scheduling; Programming language; Two-level scheduling; Mathematics","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.001079514,0.0006862094,0.0007693538,0.0006670404,0.0007149312,0.001019834,0.001016837,0.0004939554,0.003562458],"category_scores_gemma":[0.003795894,0.000531124,0.0006943416,0.001605575,0.0006243069,0.001433206,0.0005756598,0.0009668947,0.0004043872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001302194,"about_ca_system_score_gemma":0.004624689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01471692,"about_ca_topic_score_gemma":0.02487906,"domain_scores_codex":[0.9991259,0.0002631894,0.00004137505,0.0001064032,0.0003445786,0.0001186048],"domain_scores_gemma":[0.9982703,0.001137355,0.0001280757,0.00013879,0.0002773507,0.00004811085],"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.00008876125,0.00006746504,0.000530763,0.0001658193,0.00002367193,0.00005734143,0.00005524641,0.9016946,0.003356355,0.02308514,0.004010123,0.06686472],"study_design_scores_gemma":[0.00002842455,0.00002885871,0.00009688103,0.000007319818,0.000006821559,0.00001031691,0.00001527194,0.9866954,0.00164196,0.009378706,0.00208282,0.00000727872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05656121,0.0006796023,0.9303511,0.0004985207,0.00005980326,0.000213196,0.0004666021,0.001573686,0.009596385],"genre_scores_gemma":[0.2569325,0.0006253073,0.7388151,0.0001176893,0.00004008265,0.000315497,0.0007440966,0.0004105869,0.001999132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01471692,"threshold_uncertainty_score":0.02926254,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09098479028904376,"score_gpt":0.3335965103387119,"score_spread":0.2426117200496681,"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."}}