{"id":"W1493450895","doi":"10.1007/3-540-47922-8_15","title":"Genetic Algorithms for Continuous Problems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Crossover; Computer science; Encoding (memory); Algorithm; Bit array; String (physics); Decoding methods; Floating point; Range (aeronautics); Genetic algorithm; Chromosome; Point (geometry); Theoretical computer science; Mathematics; Artificial intelligence; Type (biology); Machine learning","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00114165,0.0006084503,0.00073085,0.001148969,0.0003219924,0.001008073,0.004696498,0.0003702292,0.000107312],"category_scores_gemma":[0.0003220922,0.0005693126,0.0001872108,0.0008179936,0.0007075834,0.0004145597,0.001269187,0.000723429,0.0001116994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000292084,"about_ca_system_score_gemma":0.0005015137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001171529,"about_ca_topic_score_gemma":0.000008357678,"domain_scores_codex":[0.9944125,0.00005014514,0.0007886336,0.002090836,0.001584659,0.001073254],"domain_scores_gemma":[0.9958938,0.0008106294,0.0003491314,0.001808094,0.0008185666,0.0003197403],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002050481,0.00004213349,0.000009515695,0.00006394478,0.00001878569,0.00005947941,0.0002791464,0.08451658,0.00001450774,0.006673012,0.000147321,0.9081735],"study_design_scores_gemma":[0.0004265712,0.0002488442,0.00002332347,0.000135261,0.000008384576,0.00008015065,3.800805e-8,0.9249731,0.0001209764,0.06540719,0.007972351,0.0006037865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000001562719,0.0007849297,0.9920257,0.0006939045,0.001747453,0.001501574,0.00001666217,0.0002064911,0.003021676],"genre_scores_gemma":[0.0006926504,0.0001599564,0.9936289,0.0005943713,0.0006026316,0.00007810797,0.000006264296,0.00006411023,0.004173004],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9075698,"threshold_uncertainty_score":0.9996758,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03575385609887436,"score_gpt":0.2751730455615375,"score_spread":0.2394191894626631,"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."}}