{"id":"W2164283282","doi":"10.1109/lcomm.2004.827437","title":"A New Hybrid Constraint-Based Approach for 3G Network Planning","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Computer science; Constraint (computer-aided design); Mathematical optimization; Range (aeronautics); Hybrid algorithm (constraint satisfaction); Network planning and design; Constraint satisfaction; Artificial intelligence; Mathematics; Local consistency; Computer network","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.0003347181,0.0001549123,0.000167902,0.00008524638,0.0002352033,0.00006324124,0.0006970589,0.00004975513,0.000004822671],"category_scores_gemma":[0.00004505083,0.0001878386,0.00008405674,0.0002527456,0.00008981086,0.00008820097,0.00003275691,0.0002446044,0.000006327437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001241052,"about_ca_system_score_gemma":0.0000635921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001247792,"about_ca_topic_score_gemma":0.00000118801,"domain_scores_codex":[0.9991117,0.00007140954,0.0002758493,0.0001492634,0.00009129969,0.000300504],"domain_scores_gemma":[0.998396,0.0003007313,0.00005717855,0.00111878,0.00003451156,0.00009283236],"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.000003187736,0.00001261157,0.00008285264,0.00001877864,0.0000308858,4.318484e-7,0.0001176054,0.9880418,0.002355467,0.0004832447,0.006732383,0.002120797],"study_design_scores_gemma":[0.001220495,0.00001344,0.00007698625,0.00007694055,0.0000394459,0.00001101219,0.00003912471,0.9882444,0.002550182,0.0002163572,0.007182404,0.000329222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002185034,0.0002695354,0.9928073,0.002417355,0.0001782968,0.0003658993,0.00001262507,0.0005907522,0.00117323],"genre_scores_gemma":[0.2462936,0.000007240608,0.7522261,0.001137959,0.0001131876,0.00008146332,0.00008676355,0.00004522503,0.000008478617],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2441085,"threshold_uncertainty_score":0.7659838,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04587738194204006,"score_gpt":0.2900443951567786,"score_spread":0.2441670132147385,"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."}}