{"id":"W2169184517","doi":"10.1109/ccece.1996.548128","title":"A novel technique for pipelined scheduling and allocation of data-flow graphs based on genetic algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Crossover; Scheduling (production processes); Algorithm; Benchmark (surveying); Genetic algorithm; Data flow diagram; Data-flow analysis; Parallel computing; Mathematical optimization; Artificial intelligence; 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.0005403841,0.0005861723,0.0004445047,0.0008388466,0.0004990598,0.0005405956,0.0009672081,0.0005445352,0.001589696],"category_scores_gemma":[0.001241465,0.0003766551,0.0005847594,0.001003026,0.00090052,0.0006759607,0.0004985504,0.001125584,0.000376789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000702729,"about_ca_system_score_gemma":0.001513068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002394214,"about_ca_topic_score_gemma":0.003190866,"domain_scores_codex":[0.9996376,0.00009518324,0.00001925111,0.00007170105,0.0001407614,0.00003549304],"domain_scores_gemma":[0.9995725,0.0002016767,0.00005043066,0.00008289939,0.00007471394,0.00001782949],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007358089,0.0001346319,0.0004638324,0.0002447131,0.00008631759,0.0001938177,0.0002420933,0.3895479,0.07052197,0.1098533,0.002946222,0.4256916],"study_design_scores_gemma":[0.00007637173,0.0002067134,0.0003649703,0.00004375191,0.00006018711,0.0002973638,0.00003713215,0.8952236,0.02848641,0.05088623,0.02427728,0.00004006383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001919797,0.0000638585,0.9966549,0.00004708474,0.0000200548,0.00004180804,0.00001128179,0.00033214,0.0009091527],"genre_scores_gemma":[0.05622224,0.000208035,0.9421165,0.00005571483,0.00002672197,0.0001583485,0.00004910173,0.00008744068,0.00107593],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002394214,"threshold_uncertainty_score":0.005318046,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08946241112000385,"score_gpt":0.3017508256276242,"score_spread":0.2122884145076204,"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."}}