{"id":"W2076906193","doi":"10.1142/s1469026805001611","title":"A GENETIC ALGORITHM FOR THE DESIGN OF MINIMUM-COST TWO-CONNECTED NETWORKS WITH BOUNDED RINGS","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Brock University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Computer science; Bounded function; Genetic algorithm; Algorithm; Mathematical optimization; Network planning and design; Constraint (computer-aided design); Ring (chemistry); Enhanced Data Rates for GSM Evolution; Mathematics; Artificial intelligence; Machine learning; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.000170486,0.00009888713,0.0001229006,0.0001150664,0.00005963759,0.00005406043,0.0003095524,0.00003204492,0.00001261985],"category_scores_gemma":[0.00001012414,0.00007290301,0.00005193884,0.00012268,0.00009158826,0.0001203545,0.00001324911,0.0001091954,0.000001332733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003715397,"about_ca_system_score_gemma":0.00004346935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003338163,"about_ca_topic_score_gemma":0.000001974669,"domain_scores_codex":[0.9991878,0.00001251732,0.0004069629,0.00008117067,0.000219059,0.00009249213],"domain_scores_gemma":[0.9984161,0.0006395021,0.0001736191,0.00006579153,0.0006623922,0.00004255888],"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.00001571102,0.00002586468,0.00001874286,0.000002493209,0.0001090668,5.458919e-7,0.00006048413,0.69899,0.00007270164,0.00228106,0.0001335992,0.2982897],"study_design_scores_gemma":[0.0002083489,0.0000749222,0.0002466523,0.00003558572,0.00003703747,0.0001394643,0.0000522987,0.9822572,0.002106699,0.01195979,0.002794813,0.0000871274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007845811,0.0007221306,0.9977245,0.0002305401,0.00005333253,0.000401868,0.0000157124,0.00002706298,0.0000402311],"genre_scores_gemma":[0.6695532,0.0002854459,0.3296326,0.000076863,0.0003192764,0.0001067303,0.000005762072,0.00001220689,0.000007842713],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6687686,"threshold_uncertainty_score":0.2972898,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01981469221337038,"score_gpt":0.2802936908947584,"score_spread":0.260478998681388,"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."}}