{"id":"W2062919300","doi":"10.1007/s11227-010-0473-4","title":"On-demand chaotic neural network for broadcast scheduling problem","year":2010,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Time division multiple access; Chaotic; Scheduling (production processes); Network packet; Noise (video); Artificial neural network; Real-time computing; Computer network; Mathematical optimization; Artificial intelligence","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.000802363,0.0007300625,0.001451264,0.0004471515,0.0004826217,0.0007944366,0.001222969,0.001879993,0.003869553],"category_scores_gemma":[0.003726358,0.0005528305,0.0003805444,0.0004866839,0.0007307304,0.001074041,0.0009927389,0.001263066,0.0001650387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00119149,"about_ca_system_score_gemma":0.001114429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01317989,"about_ca_topic_score_gemma":0.009206168,"domain_scores_codex":[0.9997427,0.00007644347,0.00001086193,0.00005820234,0.00003827326,0.00007361473],"domain_scores_gemma":[0.9981847,0.001342023,0.0001346331,0.00004757085,0.0001974964,0.00009356476],"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.0001136681,0.00002539002,0.0002764816,0.00004822183,0.00001662925,0.00003015666,0.00001559508,0.9903939,0.0003540392,0.002898309,0.0006860938,0.005141468],"study_design_scores_gemma":[0.000006146684,0.000004898292,0.00002630484,9.201249e-7,0.000001686025,0.000001353099,0.000002279891,0.9992256,0.00003085856,0.0006774642,0.0000214872,9.300535e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.290087,0.001012391,0.6943755,0.002339028,0.0002639781,0.0001213058,0.0003656982,0.000261192,0.01117395],"genre_scores_gemma":[0.9842479,0.0001986457,0.01095288,0.00008308314,0.00006641258,0.00007152958,0.000129146,0.00002710641,0.004223174],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01317989,"threshold_uncertainty_score":0.02620637,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01482175734885935,"score_gpt":0.2429734161137797,"score_spread":0.2281516587649204,"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."}}