{"id":"W2098945664","doi":"10.1109/ccece.2003.1226035","title":"A constraint programming approach for the design problem of cellular wireless networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint (computer-aided design); Computer science; Heuristic; Base station; Wireless; Transceiver; Computer network; Wireless network; Cellular network; Base transceiver station; Mathematical optimization; Constraint programming; Distributed computing; Wi-Fi array; Engineering; Mathematics; Stochastic programming; 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.00226975,0.002179795,0.001230034,0.0009220207,0.0009843826,0.001966193,0.002406341,0.002271611,0.004986531],"category_scores_gemma":[0.004430845,0.001059028,0.001784397,0.002804663,0.001525597,0.001566607,0.001356984,0.003841434,0.001116536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002069986,"about_ca_system_score_gemma":0.003167889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007964165,"about_ca_topic_score_gemma":0.006508613,"domain_scores_codex":[0.9980628,0.0009039668,0.00008776244,0.0002745009,0.0005480334,0.0001228795],"domain_scores_gemma":[0.9982573,0.001294423,0.0001090317,0.0000704886,0.0002140164,0.00005483201],"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.00002741803,0.00007162854,0.000145301,0.0004196992,0.00006395099,0.000184094,0.0001007923,0.7184913,0.001149789,0.2366971,0.005068009,0.03758084],"study_design_scores_gemma":[0.00004261935,0.0000661542,0.00006084347,0.000119651,0.00003495003,0.0001147875,0.00004812872,0.8737822,0.0006848198,0.09774733,0.0272691,0.00002937334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000463235,0.000359747,0.9951728,0.0003736204,0.00005366664,0.00007132583,0.00007357044,0.00003056868,0.003401455],"genre_scores_gemma":[0.05470457,0.003140107,0.9337626,0.0005518471,0.0002589168,0.001302877,0.000339526,0.00009118726,0.005848487],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007964165,"threshold_uncertainty_score":0.01668161,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02790447532119596,"score_gpt":0.2399376043916956,"score_spread":0.2120331290704996,"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."}}