{"id":"W2123728119","doi":"10.1109/ipdps.2009.5161150","title":"An Aggregated Ant Colony Optimization approach for pricing options","year":2009,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Profit (economics); Ant colony optimization algorithms; Mathematical optimization; Traverse; Node (physics); Shortest path problem; Optimization problem; Operations research; Microeconomics; Economics; Artificial intelligence; Mathematics; Engineering; Algorithm","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.0005573793,0.0001213341,0.0001518347,0.0002282861,0.0002468677,0.0003673955,0.000737491,0.00006723083,0.0000449654],"category_scores_gemma":[0.0001856027,0.0001086979,0.00004277704,0.0008733541,0.00002531681,0.0007096509,0.00004772999,0.00008506447,0.000004945505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005612643,"about_ca_system_score_gemma":0.0001056367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006816175,"about_ca_topic_score_gemma":4.904347e-7,"domain_scores_codex":[0.9985308,0.0001033377,0.0002658596,0.0004512337,0.0003255293,0.0003232364],"domain_scores_gemma":[0.9986845,0.00007632698,0.0000821062,0.0005682709,0.0004133561,0.0001754981],"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.000005383669,0.0002136708,0.000005054659,0.000004696346,0.000005781793,0.000001041069,0.00008956408,0.9464282,0.0001863512,0.03812651,0.0005263024,0.0144074],"study_design_scores_gemma":[0.0004027793,0.0002446047,0.00007094187,0.000003201476,0.000004402405,0.000008091282,0.0000175197,0.9982098,0.0004485999,0.0003168463,0.0001305888,0.0001426696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004661995,0.00003061122,0.9936541,0.0007321485,0.00007242802,0.0007013464,0.000002988544,0.000357183,0.004402562],"genre_scores_gemma":[0.01128753,0.00003010354,0.9872121,0.0003180036,0.00005385739,0.00004629044,0.00007119655,0.000009292788,0.0009716672],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05178151,"threshold_uncertainty_score":0.443257,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03032860513241782,"score_gpt":0.3141963081946118,"score_spread":0.283867703062194,"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."}}