{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003064773,0.001180426,0.001997991,0.0009498251,0.001248143,0.002738967,0.003129021,0.002616592,0.005322046],"category_scores_gemma":[0.01032722,0.0007249636,0.0007076926,0.002715842,0.002111443,0.003484818,0.001415976,0.001942508,0.0006115938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002439624,"about_ca_system_score_gemma":0.003355837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009629213,"about_ca_topic_score_gemma":0.007508555,"domain_scores_codex":[0.9973142,0.00146971,0.00004967164,0.0001695734,0.0006148458,0.0003819832],"domain_scores_gemma":[0.995307,0.003322935,0.0003837376,0.0003191272,0.00044453,0.0002226119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004590242,0.0001592818,0.0003105928,0.0002438845,0.00007497969,0.00007070348,0.00009470298,0.6885316,0.0009680457,0.2664135,0.005300996,0.03737271],"study_design_scores_gemma":[0.00007584538,0.00009146675,0.0001185395,0.00001197014,0.00001678274,0.00003625014,0.00002780163,0.8172292,0.0002521495,0.1804401,0.0016891,0.00001079967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04717143,0.003072903,0.9099028,0.001714113,0.0002432899,0.0001272973,0.00009742959,0.0003544178,0.03731629],"genre_scores_gemma":[0.7903608,0.003229919,0.1899415,0.000482805,0.0005810498,0.0002430089,0.0001828911,0.0003447258,0.01463324],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009629213,"threshold_uncertainty_score":0.01914632,"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."}}