{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001717041,0.00007416998,0.00007790214,0.0001127681,0.00003171487,0.0000770654,0.0003457823,0.00002362866,0.000008109377],"category_scores_gemma":[0.00002524214,0.00006708694,0.00001841031,0.0001795152,0.00001589417,0.0004938066,0.00006197169,0.00002195905,0.000001565167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006985819,"about_ca_system_score_gemma":0.00001313015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009965436,"about_ca_topic_score_gemma":0.000002250209,"domain_scores_codex":[0.9992921,0.00000976599,0.0001918237,0.0002693007,0.0001308789,0.0001060816],"domain_scores_gemma":[0.9993682,0.00007379377,0.00005933646,0.000397838,0.00006511193,0.00003572158],"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.00001556961,0.0003760825,0.00008204501,0.00008340657,0.00001738019,6.661538e-7,0.000138438,0.001149174,0.1155259,0.01633567,0.001212045,0.8650635],"study_design_scores_gemma":[0.0004878094,0.0001991903,0.000144861,0.00001536861,0.000004107432,0.000002242775,0.000004726094,0.9715019,0.026367,0.001022653,0.0001701116,0.00008001985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001735182,0.00001274184,0.9986166,0.0003133186,0.0000321281,0.0004382039,0.00002887891,0.0000448266,0.0003398041],"genre_scores_gemma":[0.1903265,0.000003532874,0.8092531,0.00029161,0.00000937715,0.00003820467,0.00003354111,0.000004583448,0.00003956831],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9703527,"threshold_uncertainty_score":0.2735726,"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."}}