{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001882244,0.0002063318,0.000155152,0.0002288506,0.0001972973,0.0005637417,0.0008306479,0.00008765304,0.003841102],"category_scores_gemma":[0.0001154936,0.0002157827,0.00009080074,0.0003072351,0.0002197119,0.0006721452,0.0001298295,0.0002728802,0.0002325845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001043018,"about_ca_system_score_gemma":0.00003641148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003501057,"about_ca_topic_score_gemma":0.00003490024,"domain_scores_codex":[0.9982052,0.0000724229,0.0004875203,0.0004847038,0.0004419316,0.0003082471],"domain_scores_gemma":[0.9989782,0.00008895709,0.0001833403,0.0003077527,0.0003099879,0.0001317435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008275985,0.00007423393,0.0004128498,0.00000141853,0.00001668595,0.00002470217,0.0002492562,0.07209103,0.0003599755,0.5199147,0.00006770665,0.4067792],"study_design_scores_gemma":[0.00003382645,0.00004294781,0.00008052506,0.0000319045,0.000002919857,0.00004195965,0.000106754,0.9910805,0.0009345064,0.007321035,0.00009608331,0.0002270345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005148747,0.00001528514,0.975944,0.002642992,0.002096646,0.0001430841,0.000005291218,0.0001933924,0.01381056],"genre_scores_gemma":[0.9835947,0.00003429233,0.01544761,0.000607268,0.0001847456,0.000006791197,0.000005884216,0.00001005645,0.0001086381],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9784459,"threshold_uncertainty_score":0.9970695,"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."}}