{"id":"W21360298","doi":"10.1007/s10654-011-9560-y","title":"Solving Temporal Constraints Using Neural Networks.","year":2002,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Travelling salesman problem; Artificial neural network; Computer science; Mathematical optimization; Constraint (computer-aided design); Constraint satisfaction problem; Hopfield network; Optimization problem; Focus (optics); Computation; Constraint satisfaction; Artificial intelligence; Algorithm; 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.00128452,0.001405854,0.001084168,0.001009254,0.0006816244,0.001772074,0.001736898,0.001817614,0.01033964],"category_scores_gemma":[0.00729554,0.0007354089,0.001362529,0.001256784,0.0007164416,0.002428451,0.001728165,0.002333899,0.001123944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001322471,"about_ca_system_score_gemma":0.001676255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01588977,"about_ca_topic_score_gemma":0.02431977,"domain_scores_codex":[0.9995511,0.0001446287,0.00004222959,0.0001464828,0.00005653083,0.00005903118],"domain_scores_gemma":[0.9967833,0.002586942,0.000199909,0.0001467342,0.0001879632,0.00009520799],"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.0002162355,0.0001256981,0.00219394,0.0005314558,0.0002357342,0.0001592831,0.000166538,0.6985373,0.001085301,0.03507403,0.006847317,0.254827],"study_design_scores_gemma":[0.00001183854,0.000009311517,0.0001199123,0.00002651514,0.00001696864,0.00001822086,0.00001799794,0.9657856,0.0001774991,0.03259242,0.001218046,0.000005703737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02127482,0.00418822,0.9582368,0.001777287,0.0002890044,0.0001777953,0.001229425,0.0028739,0.009952655],"genre_scores_gemma":[0.449107,0.002271024,0.535791,0.0006541347,0.0002197464,0.0008701943,0.002411976,0.0003758268,0.008298968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01588977,"threshold_uncertainty_score":0.03458959,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1587728586955939,"score_gpt":0.3267786207031929,"score_spread":0.168005762007599,"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."}}