{"id":"W2322966705","doi":"10.20381/ruor-19599","title":"Automatically generated lower bounds for search","year":2004,"lang":"en","type":"dissertation","venue":"uO Research (University of Ottawa)","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Heuristic; Computer science; Upper and lower bounds; Simple (philosophy); Travelling salesman problem; Macro; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence","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.003524232,0.00179171,0.001319937,0.003293986,0.001072901,0.005790886,0.002985384,0.001707661,0.009209113],"category_scores_gemma":[0.04210098,0.00141017,0.001820395,0.003142379,0.001798144,0.006823923,0.003606576,0.004478008,0.003330373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003790916,"about_ca_system_score_gemma":0.003189048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001922659,"about_ca_topic_score_gemma":0.00267816,"domain_scores_codex":[0.9925505,0.001616485,0.0007496261,0.001255285,0.00323446,0.0005936538],"domain_scores_gemma":[0.9757276,0.01525453,0.001113393,0.005467481,0.002150871,0.0002861214],"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.0002912476,0.0001817379,0.002388651,0.0005415872,0.00008358764,0.00009666845,0.0002502259,0.520057,0.008690426,0.2908522,0.01001192,0.1665548],"study_design_scores_gemma":[0.00003013439,0.00004612247,0.0002209333,0.00006197999,0.0000188439,0.00003940368,0.00002674169,0.8334787,0.005051079,0.1550226,0.005983022,0.00002037333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01814875,0.0005164022,0.963851,0.0004584154,0.0001221759,0.0001394058,0.0009655008,0.003933162,0.0118652],"genre_scores_gemma":[0.2766223,0.0006277019,0.7124869,0.0002955483,0.0001343927,0.0008258739,0.003927557,0.002257437,0.002822306],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009209113,"threshold_uncertainty_score":0.03080761,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04041851152014229,"score_gpt":0.3164191805298294,"score_spread":0.2760006690096871,"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."}}