{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007670475,0.0008308043,0.00119289,0.0008148809,0.0004896197,0.000774058,0.001439698,0.001031312,0.001337854],"category_scores_gemma":[0.002417481,0.0004424508,0.0006424069,0.0008218114,0.0005709183,0.0009375049,0.001090464,0.001012453,0.0004785914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004743849,"about_ca_system_score_gemma":0.0007795462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00204404,"about_ca_topic_score_gemma":0.002106419,"domain_scores_codex":[0.9995177,0.0001225499,0.00002902488,0.00006778292,0.0002244177,0.0000385431],"domain_scores_gemma":[0.9993526,0.0003541048,0.000053775,0.0000703253,0.0001340499,0.00003518739],"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.000125469,0.0001166198,0.0006417071,0.0002364702,0.00006395947,0.0002484684,0.0001321005,0.5740688,0.02004295,0.06698585,0.005394397,0.3319432],"study_design_scores_gemma":[0.0000199752,0.00003974873,0.0001257557,0.000009827191,0.000008112263,0.00007516021,0.000006754626,0.9866076,0.001689806,0.009377374,0.002030442,0.000009511751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004528438,0.000146154,0.9937747,0.00006418665,0.00001882757,0.00003016866,0.00001821836,0.0001255416,0.001293724],"genre_scores_gemma":[0.1214066,0.0002892354,0.8750017,0.0001261991,0.00005792978,0.0002561328,0.0001965737,0.0001376536,0.00252792],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00204404,"threshold_uncertainty_score":0.004475594,"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."}}