{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00360178,0.001266532,0.001331902,0.001138556,0.001201776,0.002923497,0.001862161,0.001312822,0.004211449],"category_scores_gemma":[0.01023973,0.0006501061,0.0007884357,0.002231071,0.001836849,0.003398222,0.001918374,0.00210815,0.001090814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003714989,"about_ca_system_score_gemma":0.002962647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002982494,"about_ca_topic_score_gemma":0.00244138,"domain_scores_codex":[0.9983758,0.0006954049,0.00008394282,0.0002748946,0.0003429909,0.0002269943],"domain_scores_gemma":[0.9962106,0.002760063,0.0002327077,0.0002938,0.0003726015,0.0001302436],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000123663,0.00007912052,0.0002707861,0.0001747655,0.00003734225,0.00003701414,0.0001485224,0.5399536,0.0009572466,0.3963634,0.007653428,0.05420122],"study_design_scores_gemma":[0.0000268513,0.00001993991,0.00003352795,0.00001400794,0.000006453994,0.000009704821,0.00002122329,0.8707719,0.0003225071,0.1264939,0.002273124,0.000006830566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00838494,0.001126501,0.9805319,0.000899847,0.0001654498,0.0001201368,0.0001440824,0.0003011337,0.008325927],"genre_scores_gemma":[0.5210643,0.004215237,0.4609187,0.0006020957,0.0008934738,0.0007430268,0.0005735707,0.0004612314,0.01052826],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004211449,"threshold_uncertainty_score":0.02695429,"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."}}