{"id":"W1668716869","doi":"10.1109/ccece.1993.332348","title":"A parallel algorithm for the static interference checking problem","year":2002,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Parallelism (grammar); Computer science; Interference (communication); Point (geometry); Parallel algorithm; Position (finance); Algorithm; Divide and conquer algorithms; Parallel computing; Theoretical computer science; Mathematics; 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.0009851927,0.001268607,0.001080126,0.001169376,0.001486028,0.001408888,0.002535237,0.001450803,0.008466489],"category_scores_gemma":[0.003613799,0.0005707554,0.001134453,0.001669097,0.001279866,0.003023353,0.002433906,0.001972379,0.002051799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009948176,"about_ca_system_score_gemma":0.002300383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004814898,"about_ca_topic_score_gemma":0.005157029,"domain_scores_codex":[0.9987942,0.0001943741,0.00006693344,0.0003648854,0.0003997272,0.0001799409],"domain_scores_gemma":[0.9987457,0.0005246256,0.00008312194,0.0003368526,0.0002462261,0.00006344799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004852239,0.0003833283,0.001103374,0.0003328871,0.0001123577,0.0002766482,0.0002664908,0.2325247,0.01070512,0.08132224,0.01520498,0.6572827],"study_design_scores_gemma":[0.0002177594,0.00009354153,0.0001545786,0.00001765607,0.00004968749,0.0002707966,0.00006617419,0.8895732,0.005334917,0.09473269,0.009464323,0.00002476236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004072445,0.0001110744,0.9915536,0.0002022015,0.00005228878,0.00009692753,0.00004518679,0.001355774,0.002510551],"genre_scores_gemma":[0.05806849,0.0001280122,0.9377596,0.0001096762,0.00006594018,0.0002309277,0.0002227131,0.0002614953,0.003153112],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008466489,"threshold_uncertainty_score":0.02832323,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0551439769003474,"score_gpt":0.2678228529154396,"score_spread":0.2126788760150922,"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."}}