{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007566295,0.0004496298,0.0004382596,0.0007603503,0.0003267307,0.0007921764,0.002278669,0.000291337,0.00008556173],"category_scores_gemma":[0.00007074387,0.0004184984,0.0001409482,0.0005285302,0.000692334,0.0004867596,0.0009127095,0.0007391897,0.0001401563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002684239,"about_ca_system_score_gemma":0.0006011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000296554,"about_ca_topic_score_gemma":0.0002763886,"domain_scores_codex":[0.9963545,0.00005250742,0.0004864411,0.001434143,0.001045242,0.0006271536],"domain_scores_gemma":[0.9976809,0.0003265486,0.0001949719,0.00133571,0.0002411315,0.0002207112],"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.000003310707,0.000009616096,0.0001477009,0.00001738805,0.000007061712,0.00002375643,0.0002990884,0.0432867,0.00001285696,0.1634936,0.00001618136,0.7926828],"study_design_scores_gemma":[0.0003552118,0.0001058399,0.0007937317,0.0001863693,0.000005740571,0.00009118284,1.259248e-7,0.8713458,0.000160656,0.1235706,0.002701791,0.0006830356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002143292,0.0001058217,0.982695,0.001400303,0.001366643,0.000339112,0.000002036856,0.000243306,0.01382629],"genre_scores_gemma":[0.1077868,0.00006592448,0.888719,0.001546578,0.0004072177,0.000009043472,0.000009866968,0.00003592976,0.001419654],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8280591,"threshold_uncertainty_score":0.9998267,"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."}}