{"id":"W4234739062","doi":"10.22215/etd/2005-07989","title":"Parallel implementation of bisector epsilon-approximation shortest path algorithm for concurrent queries","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Ottawa; Library and Archives Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Shortest path problem; Computer science; Path (computing); Combinatorics; Mathematics; Algorithm; Theoretical computer science; Operating system","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002674386,0.0003184777,0.0003713727,0.0002560687,0.0001041607,0.0002262773,0.0007889093,0.0001140248,0.0001202126],"category_scores_gemma":[0.00001085638,0.0003001458,0.0001598753,0.0002584093,0.0000205277,0.001137844,0.00008589985,0.00009278898,0.00001316096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005635064,"about_ca_system_score_gemma":0.0001259572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001062065,"about_ca_topic_score_gemma":0.0004819726,"domain_scores_codex":[0.997988,0.00002864429,0.0006709375,0.0005670086,0.0004428692,0.0003024923],"domain_scores_gemma":[0.9986347,0.00005579226,0.0005396465,0.0004532509,0.000254789,0.00006184921],"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.000004190917,0.00008486558,0.00004065602,0.0001385851,0.00006983585,6.06038e-7,0.0005030055,0.000009379492,0.00004825617,0.05241736,0.005654226,0.941029],"study_design_scores_gemma":[0.005163395,0.001394733,0.01489149,0.0003931714,0.0004372874,0.000003687617,0.008851714,0.8688183,0.01573286,0.005109964,0.07647349,0.002729856],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006724029,0.0002007421,0.993787,0.0001091529,0.001520977,0.0015033,0.0003279682,0.0001581978,0.001720275],"genre_scores_gemma":[0.008515755,0.0003041951,0.9603025,0.00008926825,0.000323941,0.0008081172,0.02299917,0.00005189757,0.006605151],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9382992,"threshold_uncertainty_score":0.999945,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02094093202601259,"score_gpt":0.3157385165097247,"score_spread":0.2947975844837121,"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."}}