{"id":"W6891670059","doi":"10.4224/8913779","title":"Towards development of a hybrid discrete graph-based ant colony optimization algorithm with an antibody-based immune programming algorithm","year":2005,"lang":"en","type":"report","venue":"NPARC","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Ant colony optimization algorithms; Integer programming; Optimization algorithm; Hybrid algorithm (constraint satisfaction); Development (topology); Meta-optimization; Optimization problem","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"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.0006032926,0.0003755218,0.0004835623,0.0005095619,0.0002123675,0.0005793759,0.001226291,0.0006931786,0.001779342],"category_scores_gemma":[0.0008741948,0.0002718343,0.0004821093,0.0004700468,0.0003112244,0.0006082469,0.0005182503,0.0007398328,0.0006187624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000271675,"about_ca_system_score_gemma":0.0006271719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001972227,"about_ca_topic_score_gemma":0.001654973,"domain_scores_codex":[0.9997192,0.00007458657,0.00001266007,0.00005245388,0.0001209997,0.00002017999],"domain_scores_gemma":[0.9997184,0.0001075342,0.00001928782,0.00002830504,0.0001063738,0.00002007197],"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.0001201523,0.0001953438,0.000817141,0.00009219434,0.0000823484,0.00009145456,0.00007621431,0.6363223,0.01971314,0.02904506,0.002805884,0.3106388],"study_design_scores_gemma":[0.00001446928,0.0000293189,0.00004963043,0.00000290971,0.000005676491,0.00002142782,0.000004009802,0.9956993,0.001482317,0.001175242,0.001512525,0.00000317958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004786131,0.00004799046,0.9929131,0.00005160723,0.00002168699,0.00003304854,0.00000801829,0.0003278036,0.001810613],"genre_scores_gemma":[0.08582226,0.00008056784,0.9109992,0.0000891911,0.00001717007,0.0001215593,0.00004303796,0.0000823622,0.002744652],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001972227,"threshold_uncertainty_score":0.005952537,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01960336228051401,"score_gpt":0.298024597722425,"score_spread":0.2784212354419109,"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."}}