{"id":"W2139177468","doi":"10.3138/infor.49.1.015","title":"A Constraint Optimization Approach for the Allocation of Multiple Search Units in Search and Rescue Operations","year":2011,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Mitacs","keywords":"Guided Local Search; Incremental heuristic search; Search and rescue; Beam search; Best-first search; Computer science; Mathematical optimization; Search algorithm; Search theory; Constraint (computer-aided design); Iterative deepening depth-first search; Constraint programming; Object (grammar); Operations research; Algorithm; Artificial intelligence; Mathematics; Stochastic programming","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"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.003382472,0.00009661849,0.0001295731,0.0005578343,0.0006443799,0.000404897,0.0002718678,0.00007499787,0.00002871012],"category_scores_gemma":[0.0004212767,0.00007729541,0.00001787352,0.0008456547,0.0002140391,0.002220713,0.0001678966,0.000228092,0.000001407019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007584709,"about_ca_system_score_gemma":0.0005040017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002321887,"about_ca_topic_score_gemma":0.0001524024,"domain_scores_codex":[0.9981618,0.0002206513,0.0005861103,0.0001661292,0.0006427965,0.0002225226],"domain_scores_gemma":[0.9977396,0.0003781682,0.0000318235,0.0002277526,0.00154569,0.0000770098],"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.00002879372,0.00001815168,0.0008470836,0.00005707622,0.00001037421,7.092096e-8,0.006594594,0.7686546,0.00002476885,0.2183959,0.00001696442,0.005351659],"study_design_scores_gemma":[0.0006907136,0.00008961575,0.004527614,0.00001582375,0.000001729822,0.00001844391,0.007016134,0.9872027,0.0001004183,0.000008022142,0.0002451193,0.00008366406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01122234,0.00007848895,0.9848891,0.0002772272,0.00006977264,0.001859596,0.00005082363,0.00002045158,0.001532206],"genre_scores_gemma":[0.9416542,0.0001313496,0.05748341,0.00005671267,0.00001677487,0.000448039,0.0001471649,0.000004647365,0.00005770425],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9304318,"threshold_uncertainty_score":0.4956114,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1259053238034037,"score_gpt":0.3202113026547849,"score_spread":0.1943059788513812,"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."}}