{"id":"W2130762555","doi":"10.1109/iccd.1994.331981","title":"An ILP solution for simultaneous scheduling, allocation, and binding in multiple block synthesis","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Scheduling (production processes); Integer programming; Block (permutation group theory); Interdependence; Critical path method; Linear programming; Set (abstract data type); High-level synthesis; Mathematical optimization; Job shop scheduling; Processor scheduling; Theoretical computer science; Distributed computing; Parallel computing; Algorithm; Programming language; Mathematics; Embedded system; Engineering; Schedule; Field-programmable gate array","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.0009020864,0.0009057425,0.0006232433,0.0006254784,0.000558428,0.0008821936,0.0007456662,0.0007408158,0.006178661],"category_scores_gemma":[0.001484334,0.0006236664,0.0007494122,0.0006597338,0.000684885,0.0007674682,0.0006178634,0.001217156,0.0008439449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00089557,"about_ca_system_score_gemma":0.00177613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002839207,"about_ca_topic_score_gemma":0.005361598,"domain_scores_codex":[0.9995147,0.0001720569,0.0000202775,0.00006718594,0.0001617302,0.00006416438],"domain_scores_gemma":[0.9994996,0.0003661989,0.00003739029,0.0000265442,0.00005716949,0.00001303924],"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.00004149388,0.00003116717,0.0001014414,0.0001131153,0.00002298702,0.0000695105,0.00006205489,0.9041705,0.002728524,0.02740461,0.002545715,0.06270894],"study_design_scores_gemma":[0.00002843113,0.00002379403,0.00001936584,0.00001340858,0.000009955997,0.00001889387,0.00001448121,0.9844077,0.001245933,0.01128054,0.002933232,0.000004228015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001578534,0.00008239137,0.9953541,0.0001018996,0.00002078752,0.00002921709,0.0000373832,0.0002767948,0.002518956],"genre_scores_gemma":[0.0739103,0.0001875309,0.9219208,0.0001122214,0.00003866791,0.0002457306,0.0001274347,0.0002118474,0.003245394],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006178661,"threshold_uncertainty_score":0.02066964,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02182484388445856,"score_gpt":0.2239941896528911,"score_spread":0.2021693457684325,"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."}}