{"id":"W2120915519","doi":"10.1109/ccece.2002.1013048","title":"Hopfield-genetic approach for solving the routing problem in computer networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Hopfield network; Computer science; Convergence (economics); Genetic algorithm; Computation; Mathematical optimization; Routing (electronic design automation); Artificial neural network; Population; Artificial intelligence; Algorithm; Machine learning; Mathematics; Computer network","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.0004295443,0.0006346793,0.0004645377,0.000682232,0.0004778457,0.0005076225,0.0008315353,0.0009994255,0.001515467],"category_scores_gemma":[0.000625889,0.0001934945,0.0006241552,0.0009019498,0.0006199367,0.000749998,0.0003860321,0.000813014,0.0003130056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008775807,"about_ca_system_score_gemma":0.001282013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006025518,"about_ca_topic_score_gemma":0.00727145,"domain_scores_codex":[0.9998411,0.00003613008,0.000008470109,0.00002405812,0.00007643991,0.00001381237],"domain_scores_gemma":[0.9999064,0.00003983722,0.00001072626,0.000008812851,0.00002780988,0.000006424198],"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.00002973578,0.00005287445,0.0005859435,0.0003020482,0.0001292905,0.0002090629,0.0001079452,0.6070511,0.008012393,0.1670353,0.002939544,0.2135448],"study_design_scores_gemma":[0.00003900932,0.00006876777,0.000262875,0.00005108307,0.00005751486,0.0001802062,0.0000335212,0.8772263,0.004624593,0.09808423,0.0193407,0.00003118993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003722762,0.001730026,0.9877062,0.0002320053,0.0001049038,0.00005558507,0.00002822828,0.0001587331,0.00626149],"genre_scores_gemma":[0.1377598,0.003558694,0.8484157,0.0002147516,0.0001383245,0.0002611385,0.0001040544,0.0000546134,0.009492995],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006025518,"threshold_uncertainty_score":0.01198089,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01750221600948311,"score_gpt":0.2245575453965793,"score_spread":0.2070553293870962,"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."}}