{"id":"W2503948570","doi":"","title":"Oblivious and non-oblivious local search for combinatorial optimization","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Submodular set function; Local search (optimization); Matroid; Greedy algorithm; Mathematical optimization; Mathematics; Approximation algorithm; Combinatorial optimization; Monotone polygon; Optimization problem; Function (biology); Maximization; Algorithm; Discrete 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.0003755442,0.0002960395,0.0003384047,0.0002376746,0.0003145707,0.0003297465,0.0007121832,0.0003381442,0.00004057134],"category_scores_gemma":[0.00001865409,0.0002932097,0.0001204114,0.0003818997,0.00006729309,0.0004531615,0.0001518163,0.0002832371,0.00001147259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004839297,"about_ca_system_score_gemma":0.0001511733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000130937,"about_ca_topic_score_gemma":0.00005803374,"domain_scores_codex":[0.9982244,0.00004530952,0.0003036857,0.000553162,0.0004077991,0.0004656664],"domain_scores_gemma":[0.9987668,0.000208355,0.0001105176,0.0004400116,0.0002950098,0.0001793156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002141651,0.0008401261,0.0002426661,0.000987048,0.0002257668,0.00001226561,0.005383223,0.005280337,0.0000835137,0.5959161,0.006470237,0.3843445],"study_design_scores_gemma":[0.002000832,0.0005237909,0.001702982,0.0001337929,0.00007130006,0.00001969016,0.0004092849,0.9713755,0.001345744,0.01959735,0.001779089,0.001040613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002188617,0.0003883592,0.9865364,0.00006979083,0.004876399,0.0007103282,0.00001204691,0.0001741211,0.005043898],"genre_scores_gemma":[0.7122356,0.000244166,0.2796879,0.0001579924,0.001172964,0.0002622638,0.001165044,0.00009573375,0.004978386],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9660952,"threshold_uncertainty_score":0.999952,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01641888889795221,"score_gpt":0.2714500496178985,"score_spread":0.2550311607199462,"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."}}