{"id":"W1516165084","doi":"10.1007/11523468_15","title":"Worst Case Optimal Union-Intersection Expression Evaluation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Expression (computer science); Computer science; Upper and lower bounds; Set (abstract data type); Algorithm; Mathematical optimization; Discrete mathematics; 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.0006199479,0.0002746141,0.0001898746,0.0004945716,0.0001305886,0.0001598391,0.0002565355,0.0002434999,0.0002074434],"category_scores_gemma":[0.00002483554,0.0002693531,0.00005348781,0.0002192394,0.0001221035,0.0002664277,0.00009208419,0.0004521216,0.00003193971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004136865,"about_ca_system_score_gemma":0.00007937128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006636573,"about_ca_topic_score_gemma":0.00008070159,"domain_scores_codex":[0.9985367,0.00001983991,0.0002781793,0.0004505943,0.0004642541,0.0002504296],"domain_scores_gemma":[0.9992757,0.00007899755,0.00007365015,0.0003511695,0.0001429796,0.00007752668],"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.000001363982,0.000003404928,0.000002246296,0.00001415162,0.000002600452,0.00002436836,0.0003485582,0.7644801,0.0001085659,0.00007825359,0.00002279084,0.2349136],"study_design_scores_gemma":[0.000183109,0.00003092373,0.000004172105,0.0003311388,0.000009545901,0.0003041964,3.534238e-7,0.9948149,0.001378412,0.001448597,0.001192018,0.0003026238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003160209,0.0002466243,0.9909965,0.00005707725,0.001966707,0.0002937465,0.000003521933,0.0002103011,0.005909544],"genre_scores_gemma":[0.8090959,0.00005040781,0.1894466,0.0001453333,0.0008383286,0.00001312933,0.00003257361,0.00006809098,0.0003096181],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8087798,"threshold_uncertainty_score":0.9999759,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01933709617362351,"score_gpt":0.2493565460742919,"score_spread":0.2300194499006684,"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."}}