{"id":"W2142424442","doi":"10.1109/icvd.1994.282671","title":"A new genetic algorithm for the channel routing problem","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Routing (electronic design automation); Genetic algorithm; Channel (broadcasting); Algorithm; Computer network; Machine learning","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.000464881,0.0006580994,0.0007158564,0.000811219,0.0004908246,0.0008587824,0.001046053,0.001477752,0.00417232],"category_scores_gemma":[0.001337451,0.0002841168,0.0006098427,0.0008933392,0.0006780024,0.001089302,0.0007212397,0.001156767,0.0009029142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006770239,"about_ca_system_score_gemma":0.001293321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002977449,"about_ca_topic_score_gemma":0.00309211,"domain_scores_codex":[0.9996278,0.0000922565,0.00001451442,0.00007929394,0.0001448415,0.00004127048],"domain_scores_gemma":[0.9997283,0.0001365067,0.00002016553,0.00002417621,0.00007328879,0.00001763037],"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.00005880144,0.00008650518,0.0004693397,0.0001279158,0.00006822532,0.0001433127,0.00007370502,0.6921254,0.007013154,0.06058552,0.006040625,0.2332075],"study_design_scores_gemma":[0.00004764489,0.00004213912,0.00008697819,0.00001385596,0.00001813083,0.00008090737,0.00001240142,0.9744284,0.001106102,0.01591822,0.008230804,0.00001445251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00461177,0.0002595848,0.9911168,0.0001352984,0.00008753808,0.00005393111,0.00004523223,0.0002979309,0.003392018],"genre_scores_gemma":[0.0932373,0.000589093,0.8972939,0.0002369652,0.0001020822,0.0003674149,0.0002855867,0.0001527949,0.007734868],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00417232,"threshold_uncertainty_score":0.0139578,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01888670204789744,"score_gpt":0.1999399463439825,"score_spread":0.181053244296085,"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."}}