{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006957942,0.0001440169,0.000154465,0.0001050482,0.0002602681,0.0002154061,0.0002209095,0.00005023191,0.0000223198],"category_scores_gemma":[0.00007712924,0.0001258956,0.00003188388,0.0003062227,0.0007329331,0.000158663,0.0001107739,0.0001160279,0.000005720979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000272212,"about_ca_system_score_gemma":0.00001786925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.074561e-7,"about_ca_topic_score_gemma":9.533139e-7,"domain_scores_codex":[0.9988914,0.00002963914,0.0001640524,0.0003026385,0.0002498676,0.0003623778],"domain_scores_gemma":[0.9992396,0.0002649942,0.0000231402,0.0001969804,0.0001099871,0.0001653221],"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.00000483425,0.0000300228,0.00008751739,0.00005344708,0.000006492365,8.218231e-7,0.0003545136,0.07392674,0.0007462883,0.8849236,0.00008570829,0.03977999],"study_design_scores_gemma":[0.0002890401,0.00007389189,0.000182295,0.00006465953,0.000005005272,0.00001089405,0.000005271793,0.9664767,0.001219333,0.03090824,0.0005832606,0.0001813882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04023371,0.00003618275,0.9580026,0.0004116529,0.0004752718,0.0001462524,0.000006928728,0.000252509,0.000434905],"genre_scores_gemma":[0.7571019,0.000003870923,0.2425249,0.0002023423,0.0001350248,0.000003423571,0.000006194776,0.00001636979,0.000005973541],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.89255,"threshold_uncertainty_score":0.5133873,"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."}}