{"id":"W181993896","doi":"10.1007/978-3-319-07046-9_27","title":"Parallel Depth-Bounded Discrepancy Search","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Heuristics; Iterative deepening depth-first search; Bounded function; Computer science; Pruning; Depth-first search; Workload; Search algorithm; Parallel computing; Best-first search; Search tree; Beam search; Beam stack search; Massively parallel; 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.0009297449,0.001352139,0.001738969,0.0008469417,0.0007330652,0.001537203,0.00246214,0.00135202,0.02121641],"category_scores_gemma":[0.003904514,0.000738758,0.0009307421,0.002068512,0.0008727962,0.002803731,0.002868896,0.002564154,0.004387485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001292264,"about_ca_system_score_gemma":0.001757857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002675084,"about_ca_topic_score_gemma":0.0041136,"domain_scores_codex":[0.9990394,0.0002006527,0.00004491297,0.000207739,0.0003752209,0.0001321181],"domain_scores_gemma":[0.9987798,0.0005682631,0.00005428613,0.0003577731,0.0001758992,0.00006398917],"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.0008867874,0.0002554507,0.0003963009,0.0005150672,0.00008683491,0.00009747947,0.0001136793,0.3035362,0.005871612,0.1724013,0.04537639,0.4704629],"study_design_scores_gemma":[0.0001483546,0.00005866422,0.0001226774,0.00004089775,0.00002419712,0.00008695017,0.00003291019,0.8303993,0.0028317,0.1523226,0.01391579,0.00001590255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01313875,0.001486689,0.9367213,0.0007224313,0.0002989862,0.0001063489,0.0004824994,0.003160655,0.04388235],"genre_scores_gemma":[0.2480936,0.0008210413,0.7196273,0.0004644572,0.0002152097,0.0002923681,0.0015657,0.00165045,0.02726998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02121641,"threshold_uncertainty_score":0.07097602,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02013452452198451,"score_gpt":0.2589632500686038,"score_spread":0.2388287255466193,"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."}}