{"id":"W133483171","doi":"","title":"A Novel Optimization-Based Pruning Strategy for Concave Minimum Distance Problems","year":2004,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Pruning; Simple (philosophy); Algorithm; Set (abstract data type); Interference (communication); Optimization problem; Mathematical optimization; Computer science; Separation (statistics); Mathematics; Global optimization; Machine learning","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.0001954808,0.00015382,0.0001578125,0.00006433608,0.0001421867,0.0001912634,0.0005720278,0.00006186846,0.000004381488],"category_scores_gemma":[0.00006265725,0.0001411239,0.00004975014,0.0003096381,0.00004279163,0.000312236,0.00004105921,0.00007529227,0.000007068337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008370251,"about_ca_system_score_gemma":0.0003347826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000327212,"about_ca_topic_score_gemma":0.000004356744,"domain_scores_codex":[0.9987664,0.00001103434,0.0002512396,0.0004161769,0.0002090773,0.0003460849],"domain_scores_gemma":[0.9991215,0.0001477585,0.0001125246,0.0003719124,0.000146251,0.0001000915],"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.000002363241,0.00006260463,0.00002275569,0.00001906666,0.00000690964,0.000002938118,0.0001736924,0.9777494,0.0002285106,0.02126235,0.00005727454,0.0004121392],"study_design_scores_gemma":[0.001439137,0.0001442398,0.00004354432,0.00006348114,0.000004158251,0.000006625303,0.0000259999,0.9965062,0.0005980937,0.000861963,0.0001000272,0.0002065402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003851872,0.00003041731,0.9963444,0.0008070488,0.0001955742,0.0004808478,0.000008386578,0.0003035406,0.001791243],"genre_scores_gemma":[0.1089809,4.398698e-7,0.8902482,0.00031353,0.00003536346,0.00007543417,0.00001464823,0.00001295507,0.0003185687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1089423,"threshold_uncertainty_score":0.5754866,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04107241091591587,"score_gpt":0.2690494540243707,"score_spread":0.2279770431084548,"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."}}