{"id":"W1892871566","doi":"10.1109/spdp.1993.395504","title":"Parallel network dual simplex method on a shared memory multiprocessor","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Simplex algorithm; Dual (grammatical number); Multiprocessing; Scope (computer science); Simplex; Parallel computing; Extension (predicate logic); Distributed memory; Parallel algorithm; Theoretical computer science; Mathematical optimization; Distributed computing; Algorithm; Linear programming; Shared memory; Programming language; Mathematics","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003436166,0.000214376,0.0002360787,0.00009213253,0.0002785598,0.0002121536,0.0009490461,0.00007716996,0.001046484],"category_scores_gemma":[0.00005447989,0.0001841237,0.0001318428,0.000667646,0.00004443129,0.000369826,0.0003360991,0.0002230435,0.0003916472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000207756,"about_ca_system_score_gemma":0.00001323173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003234426,"about_ca_topic_score_gemma":0.00002348152,"domain_scores_codex":[0.9981243,0.000113653,0.0002661567,0.0005893416,0.0003757797,0.0005307382],"domain_scores_gemma":[0.9986181,0.0003819301,0.00007508825,0.0007041318,0.00006278518,0.0001579501],"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.00002072889,0.0004194568,0.00004988773,0.00002629817,0.00007166452,0.0001052617,0.001512106,0.01709765,0.00003512747,0.2429603,0.1421127,0.5955889],"study_design_scores_gemma":[0.0006405752,0.0001295783,0.000437593,0.0000177437,0.000004674563,0.00002794929,0.00002456849,0.9394618,0.0001355346,0.02542936,0.03335619,0.000334451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000335962,0.0001748842,0.961701,0.002267381,0.0004321147,0.0002163296,0.000004433275,0.0005876585,0.0342802],"genre_scores_gemma":[0.02788716,0.00001796187,0.9633064,0.003763612,0.0003789471,0.00003837554,0.00000324845,0.00001509127,0.004589182],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9223641,"threshold_uncertainty_score":0.9998667,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06083322208946867,"score_gpt":0.2889409379408651,"score_spread":0.2281077158513964,"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."}}