{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007652158,0.0001091639,0.0001422221,0.00002698771,0.00006121312,0.00002792738,0.0001445272,0.0000736096,0.000004828186],"category_scores_gemma":[0.00001548543,0.00007881495,0.00005865615,0.0001927387,0.00006380303,0.00003770065,0.00001457338,0.0001008493,2.941227e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003194796,"about_ca_system_score_gemma":0.000024079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006403933,"about_ca_topic_score_gemma":4.418667e-7,"domain_scores_codex":[0.9993058,0.00003445897,0.0002342392,0.0001144934,0.00008490608,0.0002261083],"domain_scores_gemma":[0.9995176,0.0001927827,0.00004025703,0.0001584601,0.00005649037,0.00003444225],"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.000003699501,0.00001915795,0.0000110215,0.00006700465,0.00003743319,1.811709e-7,0.0001754768,0.9521433,0.001052629,0.005252441,0.00001521405,0.04122242],"study_design_scores_gemma":[0.000380188,0.00002661135,0.000003083698,0.00001670072,0.00002380946,0.000002988793,0.000181927,0.9872495,0.0117883,0.0001385211,0.00008816381,0.00010019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002579918,0.000144588,0.9974672,0.00002716849,0.00003869321,0.001104003,7.635744e-7,0.0002612527,0.000698403],"genre_scores_gemma":[0.3737519,0.00000605867,0.6260598,0.000007389605,0.00002655414,0.0001086744,0.000002663777,0.0000224855,0.00001449682],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3734939,"threshold_uncertainty_score":0.321398,"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."}}