{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006926387,0.0006908189,0.0005210802,0.0007287522,0.0004836245,0.0005011972,0.0008583197,0.0008690705,0.001504443],"category_scores_gemma":[0.001552102,0.0003782676,0.0004882202,0.0006245259,0.000686176,0.0004888239,0.0004171254,0.0006593742,0.0002122123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007879171,"about_ca_system_score_gemma":0.00132108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002975762,"about_ca_topic_score_gemma":0.002633082,"domain_scores_codex":[0.9997745,0.00007391965,0.000009082094,0.00004321971,0.00007432626,0.00002486711],"domain_scores_gemma":[0.9996784,0.0001963444,0.00003725357,0.00001808771,0.00005489723,0.00001492331],"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.00002891292,0.00003104461,0.0002277342,0.00004552282,0.00002513608,0.00005263428,0.00005296399,0.9326783,0.00291814,0.01431282,0.0006246525,0.04900216],"study_design_scores_gemma":[0.00002664312,0.00003520234,0.000050264,0.000009165738,0.000009979134,0.00002506162,0.0000101674,0.9934739,0.0008161516,0.004349872,0.001188244,0.000005331206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01518797,0.0001772357,0.9820744,0.00009980831,0.00002321913,0.0000682279,0.00001977038,0.0002063931,0.002142946],"genre_scores_gemma":[0.2010888,0.0002558181,0.7962444,0.00008202156,0.00001615405,0.0002982866,0.00007591616,0.00005456659,0.001883957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002975762,"threshold_uncertainty_score":0.005916893,"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."}}