{"id":"W2039309022","doi":"10.1109/tnet.2014.2362356","title":"A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Iterated local search; Computer science; Mathematical optimization; Integer programming; Heuristic; Algorithm; Local search (optimization); Hybrid algorithm (constraint satisfaction); Wireless network; Iterated function; Wireless; Mathematics; Local consistency; Constraint satisfaction","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.0008210462,0.0008293774,0.0008164187,0.0006279492,0.0003844619,0.0006651141,0.001390459,0.0009435262,0.00301597],"category_scores_gemma":[0.001295658,0.0003742895,0.0006567091,0.0006872811,0.00060481,0.0008875233,0.0008785914,0.0009053694,0.0004476799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008020068,"about_ca_system_score_gemma":0.001243276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005199199,"about_ca_topic_score_gemma":0.005654541,"domain_scores_codex":[0.9995827,0.0001581529,0.00001667199,0.00007536945,0.0001059758,0.00006116401],"domain_scores_gemma":[0.9995709,0.0002832329,0.00004695167,0.00002505436,0.00005069676,0.00002324006],"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.00005861485,0.0000500625,0.000270218,0.00006557788,0.00003289795,0.00006934977,0.00006266515,0.9312439,0.0009664458,0.00744182,0.001645145,0.05809335],"study_design_scores_gemma":[0.00002324903,0.00002803941,0.00003438686,0.000005470426,0.000006656972,0.00001654794,0.00001267962,0.9963577,0.0002995135,0.002334574,0.0008770945,0.000004049195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009759556,0.0002444434,0.9860372,0.0001506621,0.00002624941,0.00006814139,0.0000458828,0.000435614,0.003232309],"genre_scores_gemma":[0.3120339,0.0003052435,0.6829234,0.0002764874,0.0000438446,0.0004285758,0.0002906389,0.0001686162,0.003529313],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005199199,"threshold_uncertainty_score":0.01033789,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02212066330877365,"score_gpt":0.2632879101337656,"score_spread":0.241167246824992,"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."}}