{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001123134,0.0001600223,0.0001361989,0.0001558149,0.0003465211,0.00006774191,0.0001508995,0.00005914512,0.0002867551],"category_scores_gemma":[0.00002237262,0.0001360091,0.00004478087,0.0003753523,0.0001712539,0.0005951326,0.00003455582,0.0001370134,0.00004524995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001035638,"about_ca_system_score_gemma":0.0003573832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002127607,"about_ca_topic_score_gemma":0.0001120989,"domain_scores_codex":[0.9987405,0.00005408661,0.0002471837,0.0003738995,0.0003458932,0.0002384627],"domain_scores_gemma":[0.9992605,0.00007242931,0.0001060998,0.0002836803,0.0001577982,0.0001195229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004640281,0.0002917772,0.6261895,0.00008075525,0.00009974332,0.0002665011,0.0009861373,0.1403572,0.0006492205,0.04259687,0.005158329,0.1832776],"study_design_scores_gemma":[0.0007034828,0.000127334,0.1785115,0.00002843973,0.000005275658,0.0005096449,0.00003422148,0.818974,0.00009441883,0.0002495107,0.000490066,0.0002721276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004191258,0.00002066127,0.9904155,0.0007632162,0.0001946112,0.0002606974,0.000003176941,0.0004922061,0.003658741],"genre_scores_gemma":[0.6715584,0.000006408831,0.3280307,0.0001911753,0.00002332937,0.00001619031,0.000009236673,0.000006804476,0.0001577494],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6786168,"threshold_uncertainty_score":0.5546291,"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."}}