{"id":"W2061918649","doi":"10.1016/j.tcs.2014.02.045","title":"Online algorithms for 1-space bounded 2-dimensional bin packing and square packing","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Hebei Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bin packing problem; Bounded function; Bin; Square (algebra); Competitive analysis; Mathematics; Packing problems; Combinatorics; Unit square; Space (punctuation); Sequence (biology); Upper and lower bounds; Online algorithm; Algorithm; Best bin first; Computer science; Geometry; Mathematical analysis; Artificial intelligence; k-nearest neighbors algorithm; Chemistry","routes":{"ca_aff":true,"ca_fund":true,"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.002574058,0.002385174,0.003263867,0.001709528,0.001585541,0.004327648,0.006565191,0.003497042,0.01899532],"category_scores_gemma":[0.01723445,0.001487409,0.001909566,0.005269851,0.001771025,0.0103012,0.006483015,0.005054175,0.003919529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003247388,"about_ca_system_score_gemma":0.003514927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00434686,"about_ca_topic_score_gemma":0.007073696,"domain_scores_codex":[0.9963427,0.001058445,0.0002188633,0.0006538444,0.001009105,0.0007169514],"domain_scores_gemma":[0.9900845,0.00621371,0.0005767705,0.002050136,0.0006209143,0.000453925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001991231,0.001154345,0.001271758,0.0009857779,0.0001669959,0.0001677621,0.0004010212,0.3969565,0.003927808,0.1288849,0.03836625,0.4257256],"study_design_scores_gemma":[0.0001597475,0.0000977345,0.0002413219,0.00004394623,0.00003870497,0.00008726509,0.00007656183,0.8744722,0.001304757,0.1196438,0.003809717,0.00002429229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02717782,0.002084805,0.9486464,0.00152453,0.0004543295,0.0003039071,0.0006472778,0.003497895,0.01566291],"genre_scores_gemma":[0.2629128,0.001111302,0.7196401,0.0007128374,0.0004037721,0.000827019,0.001612533,0.001058111,0.01172145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01899532,"threshold_uncertainty_score":0.06354564,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01369762167569942,"score_gpt":0.246702862499147,"score_spread":0.2330052408234476,"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."}}