{"id":"W112014004","doi":"","title":"Optimal scheduling of contract algorithms for anytime problems","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Computer science; Acceleration; Computation; Algorithm; Scheduling (production processes); Mathematical optimization; Schedule; Matching (statistics); Approximation 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.003843816,0.0008630357,0.001245235,0.0006259469,0.0008652807,0.001736522,0.002063565,0.000957913,0.003031323],"category_scores_gemma":[0.01605367,0.0006630218,0.000782123,0.0009909954,0.002014987,0.003348047,0.001629365,0.001857317,0.0004725595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002371998,"about_ca_system_score_gemma":0.003045777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002429649,"about_ca_topic_score_gemma":0.00281426,"domain_scores_codex":[0.9972064,0.0009854897,0.0001796982,0.0003737783,0.000734374,0.0005201133],"domain_scores_gemma":[0.9936626,0.003537626,0.0006341679,0.001066286,0.0005532888,0.0005459585],"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.0006035125,0.0001999424,0.0008419832,0.00019093,0.00004660255,0.00007101677,0.0003130882,0.6276612,0.002572587,0.3076409,0.002504275,0.05735398],"study_design_scores_gemma":[0.00008053739,0.00007888789,0.0001141573,0.00001093165,0.00001116163,0.00002100863,0.00003354923,0.8426896,0.001189953,0.1542852,0.001474474,0.0000105965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08937823,0.0004065641,0.8996734,0.0004301677,0.00006329563,0.0001967647,0.000113124,0.0004218705,0.009316531],"genre_scores_gemma":[0.61791,0.0005105016,0.3765921,0.0001436475,0.00008662834,0.0002982031,0.0003351362,0.0002707808,0.003853069],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003843816,"threshold_uncertainty_score":0.02032828,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1439905611302124,"score_gpt":0.3591819608483168,"score_spread":0.2151913997181044,"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."}}