{"id":"W2057440614","doi":"10.1007/s11227-014-1243-5","title":"Efficient routing based on past information to predict the future location for message passing in infrastructure-less opportunistic networks","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Geographic routing; Latency (audio); Wireless Routing Protocol; Dynamic Source Routing; Probabilistic logic; Distributed computing; Routing (electronic design automation); Link-state routing protocol; Zone Routing Protocol; Telecommunications; Artificial intelligence","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.0008508543,0.0004327418,0.0007593359,0.0009967178,0.0008730947,0.000777761,0.001420219,0.0005525118,0.0007489111],"category_scores_gemma":[0.004784899,0.0004482729,0.0002850784,0.001062725,0.0006192602,0.001471999,0.0009793475,0.0005495701,0.0001549945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001047363,"about_ca_system_score_gemma":0.001209666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0105905,"about_ca_topic_score_gemma":0.01738431,"domain_scores_codex":[0.999597,0.000096793,0.00002803632,0.0000811579,0.0001104278,0.00008658911],"domain_scores_gemma":[0.9980282,0.00109247,0.0002456871,0.0002677738,0.0002735185,0.00009232213],"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.0001660054,0.00006251899,0.002241547,0.0000521015,0.0000336246,0.00009456097,0.0001153481,0.9335813,0.00263889,0.01374347,0.001425027,0.04584562],"study_design_scores_gemma":[0.000003163073,0.000008833437,0.0001043223,0.000001616396,0.000003831912,0.0000105496,0.00001067214,0.9965352,0.0002544865,0.002923999,0.0001402659,0.000002957951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2014925,0.0005698483,0.793661,0.0003807509,0.0001131959,0.00009598618,0.000267431,0.0005803184,0.002838825],"genre_scores_gemma":[0.9582338,0.0002197133,0.04001887,0.00003405679,0.00003416094,0.00004874424,0.0002028138,0.00003344581,0.001174372],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0105905,"threshold_uncertainty_score":0.02105772,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009991258978234632,"score_gpt":0.2177091045419444,"score_spread":0.2077178455637098,"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."}}