{"id":"W7061966825","doi":"","title":"Scheduling algorithms for throughput maximization in data networks","year":2007,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Magnetic confinement fusion research","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Bell (Canada)","funders":"Office of Naval Research; University of Illinois at Urbana-Champaign; Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; National Aeronautics and Space Administration; National Science Foundation","keywords":"Scheduling (production processes); Maximization; Fair-share scheduling; Throughput; Approximation algorithm; Job shop scheduling; Algorithm design","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.000773555,0.0002295104,0.0003523532,0.0006508679,0.0001237739,0.00003173215,0.00106729,0.0002392186,0.001220476],"category_scores_gemma":[0.0001320352,0.000237271,0.00006555014,0.0011114,0.000278549,0.0001472598,0.0006451994,0.0004112638,0.000006539589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002573712,"about_ca_system_score_gemma":0.0001301665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003002558,"about_ca_topic_score_gemma":0.0005980075,"domain_scores_codex":[0.9979697,0.00001355023,0.0005600344,0.0005739139,0.0002755011,0.0006072985],"domain_scores_gemma":[0.9983085,0.00007226303,0.0002294717,0.001151222,0.0001690207,0.00006956992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006886491,0.0003658883,0.04577447,0.0000576655,0.0001222562,0.0000119153,0.0000545005,0.002433297,0.001610697,0.03266309,0.003876793,0.9129605],"study_design_scores_gemma":[0.004299583,0.0002050425,0.003992949,0.0002347942,0.0000810961,0.000002799666,0.0008599035,0.2370955,0.007154373,0.002674765,0.7426873,0.0007118775],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04494898,0.00037128,0.9315643,0.007662185,0.0005918787,0.001555894,0.0001752535,0.0001679081,0.01296233],"genre_scores_gemma":[0.7977538,0.00004624321,0.1999444,0.00005286444,0.0002787082,0.0001034099,0.0005543001,0.00003962885,0.001226672],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9122487,"threshold_uncertainty_score":0.9996926,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03681252495887389,"score_gpt":0.317647786815288,"score_spread":0.2808352618564141,"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."}}