{"id":"W2006278327","doi":"10.1109/tsmcb.2012.2221695","title":"Efficient Shortest-Path-Tree Computation in Network Routing Based on Pulse-Coupled Neural Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Dijkstra's algorithm; Computer science; Shortest path problem; Computation; Router; Path (computing); Tree (set theory); K shortest path routing; State (computer science); Routing (electronic design automation); Link-state routing protocol; Algorithm; Routing protocol; Theoretical computer science; Mathematics; Computer network; Graph","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.0003831958,0.0004170992,0.0005977602,0.0003630556,0.0004780117,0.0005480162,0.00121096,0.0008766777,0.0008882644],"category_scores_gemma":[0.001369157,0.0003980442,0.0003909296,0.0007425185,0.0005812493,0.001405648,0.0006211163,0.0008269267,0.0001145766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00091123,"about_ca_system_score_gemma":0.0009877707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0084028,"about_ca_topic_score_gemma":0.007531892,"domain_scores_codex":[0.9998294,0.00004041251,0.0000103806,0.00003735622,0.0000631701,0.00001921707],"domain_scores_gemma":[0.9997008,0.000162576,0.00002510084,0.00002364726,0.00007364023,0.00001421092],"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.0000346335,0.00001991995,0.0002759293,0.00004863168,0.00001973856,0.00004735568,0.00003327043,0.9575531,0.002366417,0.01303726,0.0004451188,0.02611856],"study_design_scores_gemma":[0.000001463254,0.000003368316,0.00001627737,7.256454e-7,0.000001493514,0.000004164967,0.000001073382,0.9984824,0.0001278329,0.001307606,0.00005221268,0.000001399933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0239283,0.0003397405,0.9733675,0.0001321035,0.00003796991,0.00002300583,0.0000237167,0.0002075329,0.001940261],"genre_scores_gemma":[0.774877,0.0007057288,0.2211641,0.0001089204,0.00004468181,0.0001735811,0.0001159535,0.00005534543,0.002754692],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0084028,"threshold_uncertainty_score":0.01670778,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01619248070171676,"score_gpt":0.2442163678952547,"score_spread":0.2280238871935379,"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."}}