{"id":"W1583127423","doi":"","title":"Optimizing performance of ad-hoc networks under energy and scheduling constraints","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Wireless ad hoc network; Distributed computing; Scheduling (production processes); Survivability; Job shop scheduling; Wireless sensor network; Computer network; Data collection; Mobile ad hoc network; Approximation algorithm; Wireless network; Wireless; Mathematical optimization; Algorithm; Routing (electronic design automation)","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.002031794,0.0009350664,0.0006465474,0.0004524834,0.0005548262,0.001300282,0.0007340284,0.0007235094,0.00118502],"category_scores_gemma":[0.006364533,0.0003185023,0.0001726927,0.0009117672,0.0007369403,0.001638926,0.0006759813,0.0005616875,0.0001868119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001242571,"about_ca_system_score_gemma":0.0007343506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00150429,"about_ca_topic_score_gemma":0.001144633,"domain_scores_codex":[0.9989997,0.0005203331,0.00003166328,0.00009881634,0.0001746333,0.000174925],"domain_scores_gemma":[0.9966285,0.002579631,0.0002449503,0.00013829,0.0002676844,0.0001408959],"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.0001251406,0.0000393464,0.0006013808,0.000048801,0.00001730647,0.0000307935,0.00001986116,0.9825169,0.002137444,0.005853717,0.0004340873,0.008175097],"study_design_scores_gemma":[0.000009680872,0.00005133014,0.0001239315,0.000003796471,0.000005400404,0.00001096526,0.00001965953,0.9950505,0.0009710119,0.003577872,0.0001736239,0.000002277095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4540736,0.002684166,0.5236188,0.001419118,0.0001856272,0.0001083282,0.0001971273,0.0004037182,0.01730945],"genre_scores_gemma":[0.9834216,0.0004607656,0.01501335,0.00002942377,0.00004461534,0.0000281488,0.00004393149,0.00002933028,0.0009287762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002031794,"threshold_uncertainty_score":0.01074523,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009177230409929295,"score_gpt":0.2133166444151469,"score_spread":0.2041394140052176,"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."}}