{"id":"W62155812","doi":"","title":"Fair Matching Algorithm: Fixed-Length Frame Scheduling in All-Photonic Networks.","year":2006,"lang":"en","type":"article","venue":"","topic":"Optical Network Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Scheduling (production processes); Bottleneck; Proportionally fair; Photonics; Distributed computing; Matching (statistics); Round-robin scheduling; Dynamic priority scheduling; Algorithm; Mathematical optimization; Topology (electrical circuits); Computer network; Mathematics; Quality of service","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.003528007,0.0006165578,0.0006927248,0.000859724,0.00105321,0.001092043,0.00209195,0.001020358,0.003012398],"category_scores_gemma":[0.005494731,0.0002379268,0.0003707743,0.0008787061,0.001165945,0.002096947,0.0008085954,0.0007607558,0.0004877485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001820744,"about_ca_system_score_gemma":0.00220725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003338546,"about_ca_topic_score_gemma":0.003423844,"domain_scores_codex":[0.9990527,0.0003664419,0.00003404341,0.0001388829,0.0002696531,0.0001382463],"domain_scores_gemma":[0.9987735,0.000681276,0.0001072608,0.0001574923,0.0002039078,0.00007644537],"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.0009262569,0.0002805757,0.001053113,0.0001511264,0.0001082434,0.0001292433,0.0001988138,0.5241552,0.008463279,0.184562,0.007359911,0.2726122],"study_design_scores_gemma":[0.00007698723,0.00009493383,0.000115982,0.0000116519,0.0000173365,0.00004879519,0.00001539251,0.9503376,0.004236652,0.0413429,0.003686609,0.00001503311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01122003,0.0004118079,0.9854975,0.0001273137,0.0001219032,0.0001187572,0.00004907282,0.0003060576,0.002147517],"genre_scores_gemma":[0.4672558,0.0004146282,0.5272729,0.0001752027,0.0001259993,0.000225207,0.000154393,0.00008491824,0.004290882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003528007,"threshold_uncertainty_score":0.01865816,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007611355605453858,"score_gpt":0.2124714080874443,"score_spread":0.2048600524819905,"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."}}