{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008696769,0.0001539511,0.0002145084,0.0000605356,0.0001605888,0.00003270696,0.0003281214,0.00005501,0.000005943089],"category_scores_gemma":[0.00007773582,0.0001088622,0.0000918137,0.0001017896,0.00004129668,0.0001593865,0.00004625697,0.0007188898,0.000001939719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000281719,"about_ca_system_score_gemma":0.00001005589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001070925,"about_ca_topic_score_gemma":0.000001409855,"domain_scores_codex":[0.9990848,0.00002687338,0.000366841,0.00007119969,0.000135624,0.0003146955],"domain_scores_gemma":[0.9991485,0.0004505085,0.00009207008,0.0001545943,0.00009289785,0.00006145539],"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.00002524949,0.000008667055,0.00009699367,0.00003564697,0.0000299316,0.000003742293,0.0002995026,0.9424255,0.04579765,0.0009745855,0.0002841547,0.01001841],"study_design_scores_gemma":[0.000686428,0.0004152489,0.0005909587,0.0005497139,0.00006028576,0.0006092023,0.0001248796,0.9623359,0.01379456,0.01897364,0.001480525,0.0003785981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.674035,0.0001692962,0.324791,0.00008404577,0.000557456,0.0001421548,9.830552e-7,0.0001218764,0.00009818544],"genre_scores_gemma":[0.7982848,0.00001323804,0.2005668,0.00004731154,0.001041035,0.000001462557,4.297104e-7,0.00004042841,0.000004535],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1242498,"threshold_uncertainty_score":0.4439274,"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."}}