{"id":"W2139257162","doi":"10.1109/ictai.2008.43","title":"Solving Temporal Constraint Satisfaction Problems with Heuristic Based Evolutionary Algorithms","year":2008,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Heuristics; Computer science; Heuristic; Constraint satisfaction; Descendant; Evolutionary algorithm; Evolutionary computation; Constraint (computer-aided design); Genetic algorithm; Mathematical optimization; Theoretical computer science; Algorithm; Artificial intelligence; Machine learning; Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001359126,0.0007069548,0.0006964394,0.001014554,0.0003722294,0.0007808759,0.0007264678,0.0009742202,0.001042362],"category_scores_gemma":[0.00396724,0.0003672409,0.0006544892,0.001204243,0.0005760284,0.0006806387,0.0005534004,0.0006626018,0.0001483259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004977894,"about_ca_system_score_gemma":0.0006482262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002655531,"about_ca_topic_score_gemma":0.002419587,"domain_scores_codex":[0.9992023,0.000405865,0.00003321321,0.00005862533,0.0002387088,0.00006124168],"domain_scores_gemma":[0.9986339,0.0009911798,0.00009965074,0.0001022948,0.0001454591,0.00002746502],"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.00004054073,0.00004975384,0.0006528799,0.00006689846,0.0000656054,0.00007307763,0.00004705292,0.9365681,0.001652678,0.01010169,0.0003287336,0.05035293],"study_design_scores_gemma":[0.00002549314,0.00004374703,0.0001695652,0.00001160381,0.00001530967,0.00005176493,0.00002183507,0.9937622,0.0008023927,0.004152493,0.0009366104,0.000007042847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06806438,0.0006792364,0.9258629,0.0001668542,0.00003801618,0.00008051004,0.00003500672,0.0002487027,0.004824391],"genre_scores_gemma":[0.3852172,0.0006045878,0.6122139,0.0001388354,0.00004129933,0.0002026918,0.0001249042,0.00006607146,0.001390567],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002655531,"threshold_uncertainty_score":0.007187784,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01817280977519148,"score_gpt":0.2116914481854112,"score_spread":0.1935186384102198,"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."}}