{"id":"W2051092461","doi":"10.1016/j.tcs.2003.08.001","title":"On-line parallel heuristics, processor scheduling and robot searching under the competitive framework","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Heuristics; Computer science; Scheduling (production processes); Point (geometry); Robot; Heuristic; Path (computing); Line (geometry); Motion planning; Mathematical optimization; Mathematics; Artificial intelligence; Upper and lower bounds; Programming language","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.002322421,0.0001843918,0.0001744081,0.0001220695,0.001001442,0.0009652383,0.001531834,0.00005245777,0.00003602984],"category_scores_gemma":[0.0006227306,0.0001200848,0.00003505016,0.0009595878,0.002957411,0.0003628995,0.0006159196,0.0005544354,0.00004615334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003611573,"about_ca_system_score_gemma":0.0001879771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001020218,"about_ca_topic_score_gemma":3.025533e-7,"domain_scores_codex":[0.9973632,0.0003169216,0.0002343832,0.0006825644,0.0007947208,0.0006081865],"domain_scores_gemma":[0.9973949,0.001382224,0.00005855961,0.000600819,0.0002616068,0.0003018434],"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.000004485887,0.00004698355,0.000009596335,0.000006274517,0.00000350956,0.000003487655,0.0005003916,0.09778631,0.00001054821,0.8997678,0.00000478564,0.001855801],"study_design_scores_gemma":[0.0001194463,0.0001273822,0.00005315637,0.00004268814,0.000001337165,0.00001246284,0.00002867199,0.5623505,0.0001272772,0.437004,0.00002487986,0.0001082118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002091124,0.00004311119,0.9886951,0.005062437,0.000244099,0.0002534229,6.271943e-7,0.0001171348,0.003492919],"genre_scores_gemma":[0.5869942,0.0000128988,0.4111667,0.001771577,0.00003256501,0.000005467105,2.215742e-7,0.000005738445,0.00001065602],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5849031,"threshold_uncertainty_score":0.999756,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0251432603993933,"score_gpt":0.3021206933952823,"score_spread":0.276977432995889,"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."}}