{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006497242,0.0006936081,0.0008146298,0.001121364,0.0009810756,0.001579392,0.0023358,0.0005694743,0.007731751],"category_scores_gemma":[0.001677845,0.0003485351,0.0004766906,0.001573678,0.0003442417,0.001446882,0.001267764,0.0006498586,0.001528267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001401335,"about_ca_system_score_gemma":0.002424703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01130879,"about_ca_topic_score_gemma":0.01330025,"domain_scores_codex":[0.9990253,0.0001107869,0.00007919341,0.0002276013,0.0003725543,0.0001845458],"domain_scores_gemma":[0.9991302,0.0001923996,0.00004758178,0.0002180083,0.0003233581,0.00008853591],"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.002816868,0.000875094,0.00444111,0.0004662937,0.0001249316,0.0003155933,0.0005521392,0.09947905,0.05772493,0.02541256,0.01802275,0.7897686],"study_design_scores_gemma":[0.0003261909,0.0002386925,0.0009517965,0.00001953237,0.00004432201,0.0002213268,0.0001849599,0.951808,0.02643377,0.009820074,0.009921802,0.00002964855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1152294,0.0006592061,0.8552076,0.0003388309,0.0001662448,0.0003707186,0.0005149324,0.01152735,0.01598573],"genre_scores_gemma":[0.4114542,0.000193874,0.5787865,0.0000931848,0.00003319341,0.0002221318,0.001369883,0.0004279931,0.007419046],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01130879,"threshold_uncertainty_score":0.02586532,"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."}}