{"id":"W52929814","doi":"10.5220/0002253403140317","title":"A NEW HYBRID GENETIC ALGORITHM FOR MAXIMUM INDEPENDENT SET PROBLEM","year":2009,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Crossover; Genetic algorithm; Heuristic; Algorithm; Computer science; Set (abstract data type); Mutation; Mathematical optimization; Population-based incremental learning; Operator (biology); Meta-optimization; Variety (cybernetics); Mathematics; Artificial intelligence; Biology","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.0004800821,0.0001719154,0.0001964803,0.000195003,0.0001112598,0.0003829247,0.001170603,0.00004867197,0.0002705189],"category_scores_gemma":[0.00006373292,0.0001524118,0.00008143892,0.0004084607,0.00001467937,0.0002795764,0.0001775066,0.000127156,0.000155404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005627728,"about_ca_system_score_gemma":0.000319862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002894164,"about_ca_topic_score_gemma":0.000001322753,"domain_scores_codex":[0.9978684,0.00007072552,0.0003391619,0.0005652814,0.0006479407,0.0005085029],"domain_scores_gemma":[0.9986138,0.000096825,0.00007209604,0.0006401042,0.0002334181,0.0003438],"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.00000197696,0.00004171367,0.000003771032,0.000004291493,0.0000105192,0.00001805832,0.00005107459,0.0008295999,0.00001967627,0.004009456,0.02188069,0.9731292],"study_design_scores_gemma":[0.0007627304,0.0002456283,0.0002168448,0.000005245129,0.00000490032,0.00006860367,0.000004618018,0.9429497,0.001151085,0.04207656,0.01230207,0.0002119902],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001020511,0.00007719701,0.9931611,0.002343617,0.0001697838,0.0008014569,0.000007958161,0.0002250781,0.003203583],"genre_scores_gemma":[0.000482126,0.00002094003,0.9885164,0.0006663924,0.0001324018,0.00003334325,0.000009305905,0.00001195032,0.01012714],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9729172,"threshold_uncertainty_score":0.6215172,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02342807466795358,"score_gpt":0.2887353667167887,"score_spread":0.2653072920488351,"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."}}