{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002714944,0.00008680239,0.00008626936,0.00001933283,0.0001751687,0.0001596989,0.0004842554,0.0000394974,0.000002620917],"category_scores_gemma":[0.00000408364,0.00005677402,0.00004420779,0.0003069881,0.00001580482,0.00009001425,0.00009183461,0.0001188502,0.000001853664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009756924,"about_ca_system_score_gemma":0.00001461273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001185715,"about_ca_topic_score_gemma":0.000009823333,"domain_scores_codex":[0.9991521,0.00003143589,0.0001826365,0.0002760514,0.0000679333,0.000289836],"domain_scores_gemma":[0.9994062,0.0001652615,0.00004431275,0.0003281454,0.00002307759,0.00003305444],"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":[8.300249e-7,0.00006062322,0.001301979,0.000007084434,0.000005924057,6.344891e-7,0.0001749473,0.5921686,0.00002366106,0.307469,0.003375033,0.09541168],"study_design_scores_gemma":[0.0001285603,0.00001550718,0.0005009231,0.000004936766,0.000001434323,0.000006634988,0.000009555947,0.9952096,0.00002779906,0.002852625,0.00115465,0.00008775381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006360959,0.00007063501,0.994857,0.0006082759,0.00007340258,0.0005167481,1.033935e-7,0.00005946596,0.003178255],"genre_scores_gemma":[0.5318195,0.000004970984,0.4672588,0.0006466922,0.00007502342,0.0001049174,6.534625e-7,0.000004338735,0.0000851718],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5311834,"threshold_uncertainty_score":0.2315177,"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."}}