{"id":"W2783239915","doi":"10.1007/978-3-319-74439-1_12","title":"An Efficient Routing and Interface Assignment Algorithm for Multi-Channel Multi-Interface (MCMI) Ad Hoc Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Interface (matter); Algorithm; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Computer network; Distributed computing; Link-state routing protocol; Routing (electronic design automation); Wireless; Routing protocol; Parallel computing; Telecommunications","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.0004722871,0.0008187988,0.0008810981,0.0006938319,0.0009045735,0.001068095,0.002015291,0.0007045057,0.004852183],"category_scores_gemma":[0.001539646,0.0003814317,0.0004489293,0.001298668,0.0003524919,0.001344881,0.001016092,0.001089661,0.000971627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009922,"about_ca_system_score_gemma":0.001385123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003212865,"about_ca_topic_score_gemma":0.005755548,"domain_scores_codex":[0.9996656,0.00007017331,0.00001700208,0.00005647867,0.0001311578,0.00005944506],"domain_scores_gemma":[0.9994906,0.0001893472,0.00003893941,0.00008823896,0.0001568271,0.00003602598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002148075,0.0002039213,0.000378567,0.0001613899,0.00003786397,0.00006210896,0.00009661926,0.2598417,0.009722418,0.02480636,0.01618231,0.6882918],"study_design_scores_gemma":[0.00003346559,0.00005359315,0.000126423,0.000007748035,0.00001149636,0.00005634545,0.00002354949,0.9868135,0.001898682,0.007887891,0.003076385,0.00001080666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01011262,0.0002933899,0.9823199,0.000163549,0.0001590265,0.0001352156,0.00009505817,0.001684158,0.005037037],"genre_scores_gemma":[0.1043144,0.0002106011,0.8891972,0.00008534142,0.00006163507,0.000202326,0.0003252225,0.0001726022,0.005430697],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004852183,"threshold_uncertainty_score":0.01623213,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02898009330017165,"score_gpt":0.2705286122830046,"score_spread":0.241548518982833,"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."}}