| Document Date: 2009-08-06 19:20:44
Open Document File Size: 340,41 KBShare Result on Facebook
City Los Angeles / Davenport / / / Facility Jet Propulsion Laboratory California Institute of Technology / Computer Science Department University of California / / IndustryTerm real-world applications / bin completion search tree / storage devices / bin packing solution / transportation / bin-oriented branch-and-bound algorithm / multi-agent systems / partial solution / branch-and-bound search tree / valid solution / artificial intelligence applications / search procedure / extended bin completion algorithm / bin-oriented search space / pseudo-polynomial time algorithm / bin packing search tree / Classical applications / dynamic programming algorithms / state-ofthe-art algorithm / search tree / earlier algorithm / bin completion algorithm / search space / bin completion algorithms / chemicals / search efficiency / food / / Organization California Institute of Technology / AI Access Foundation / University of California / Los Angeles / / Person Alex S. Fukunaga / / Position representative / / ProvinceOrState California / / PublishedMedium Journal of Artificial Intelligence Research / / Technology semiconductor / earlier algorithm / 396 Bin Completion Algorithms / extended bin completion algorithm / 400 Bin Completion Algorithms / dynamic programming algorithms / artificial intelligence / previous state-ofthe-art algorithm / bin-oriented branch-and-bound algorithm / 398 Bin Completion Algorithms / bin completion algorithms / pseudo-polynomial time algorithm / 3/07 Bin Completion Algorithms / 394 Bin Completion Algorithms / bin completion algorithm / /
SocialTag |
Journal of Artificial Intelligence Research[removed]429 Submitted 6/06; published 3/07 Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems