{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000451487,0.0007390361,0.0005460581,0.0006446271,0.0004621066,0.0009145479,0.001453747,0.0007993612,0.00350596],"category_scores_gemma":[0.0007393782,0.0004182676,0.0008136616,0.001421845,0.000446215,0.001111991,0.0008508741,0.0009387602,0.0005798474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001149938,"about_ca_system_score_gemma":0.001583277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008220222,"about_ca_topic_score_gemma":0.01354075,"domain_scores_codex":[0.9995404,0.0001435349,0.00001758246,0.00006604151,0.000199591,0.00003282688],"domain_scores_gemma":[0.9997409,0.0001270345,0.00002774279,0.00003805387,0.00004983203,0.0000164562],"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.0000443622,0.00004304972,0.0002372515,0.0001142235,0.00006159347,0.0001390863,0.00005042804,0.8241929,0.003597496,0.08348639,0.00534843,0.08268471],"study_design_scores_gemma":[0.000009109413,0.00001408379,0.00004473013,0.000007326029,0.000008174406,0.0000418434,0.000006919595,0.980574,0.0006285842,0.01304574,0.005610102,0.000009550852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001369938,0.0001127377,0.9952735,0.000138564,0.00002262103,0.00002826624,0.0001002201,0.0001277012,0.002826321],"genre_scores_gemma":[0.1372588,0.0005913505,0.8563756,0.0002435142,0.00005979879,0.0003148819,0.0003457452,0.0001329494,0.004677266],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008220222,"threshold_uncertainty_score":0.01634479,"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."}}