Conference paper
Reasoning about RoboCup soccer narratives
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
We consider the problem of packing rectangles into bins which are unit squares. We give an on-line algorithm that uses at most 3.25 times the optimal number of bins. We also prove a result for the case when the items to be packed are squares and discuss extensions to higher dimensions. © 1989.
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ
Don Coppersmith
Journal of Combinatorial Theory, Series A
Matthew A Grayson
Journal of Complexity