{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003216462,0.0001393936,0.0001359979,0.0000465495,0.0001891473,0.0002333603,0.001217855,0.00003582365,0.0000351583],"category_scores_gemma":[0.0000441725,0.00008774615,0.00005826717,0.000235021,0.00004277901,0.0002855025,0.0001815392,0.0001260127,0.0001083123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002876343,"about_ca_system_score_gemma":0.00001822023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002394131,"about_ca_topic_score_gemma":0.000001114493,"domain_scores_codex":[0.9988277,0.00003348585,0.0002242463,0.0003364776,0.0002018348,0.0003762814],"domain_scores_gemma":[0.998806,0.0004649569,0.00007894041,0.0005128224,0.00007138193,0.00006588102],"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":[7.704218e-7,0.00005459118,0.00003032442,0.00001338316,0.00003447092,0.000009164798,0.002392116,0.003495437,0.00001563822,0.008918205,0.009778423,0.9752575],"study_design_scores_gemma":[0.0002690345,0.00008726998,0.00008435779,0.00002647774,0.000006155684,0.00002622243,0.00005611623,0.9948622,0.00005145045,0.002682206,0.001709069,0.0001394352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000009551871,0.0001773493,0.9938701,0.002723075,0.0002625898,0.0004220168,0.000001860253,0.0002351514,0.002298278],"genre_scores_gemma":[0.006087967,0.00001530082,0.9898659,0.0006062937,0.0000590093,0.0001438618,7.355831e-7,0.000009404475,0.003211543],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9913667,"threshold_uncertainty_score":0.3578184,"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."}}