View Document Preview and Link Document Date: 2008-06-08 00:43:43 Open Document File Size: 216,93 KB Share Result on Facebook
City Los Angeles / Hanoi / / Company IBM / Hitachi / AMD / / Currency USD / / / Facility Towers of Hanoi / University of California / Two-Bit Breadth-First Search Richard E. Korf Computer Science Department University of California / / IndustryTerm heuristic search / parallel algorithms / frontier search / breadth-first search / parallel processing / external file server / parallel breadth-first search / permutation / maximum search depth / similar algorithm / systematic search / pancake network / breadth-first frontier search / simpler solution / breadthfirst frontier search / parallel algorithm / correct breadth-first search algorithm / parallel in-memory algorithm / simpler algorithm / breadth-first search algorithm / breadthfirst search / search depth / / NaturalFeature Robinson waterfall / Kunkle waterfall / Cooperman waterfall / / OperatingSystem Linux / Centos / / Organization National Science Foundation / University of California / Berkeley / Computational Intelligence / Computer Science Division / Two-Bit Breadth-First Search Richard E. Korf Computer Science Department University / University of California / Los Angeles / / Person Harry Dweighter / Peter Schultze / Jacob E. Goodman / Yuval Tamir / David P. Robbins / Satish Gupta / Eddie Kohler / Tomas Rokicki / / / Position sloppy chef / waiter / / Product Opteron processors / Opteron / / ProvinceOrState California / / PublishedMedium American Mathematical Monthly / / Technology BFS algorithms / search algorithm / Linux / 128 processors / parallel algorithm / two parallel algorithms / correct two-bit BFS algorithm / BFS algorithm / two-gigahertz Opteron processors / parallel in-memory algorithm / artificial intelligence / simpler algorithm / parallel processing / / URL www.aaai.org / / SocialTag 
Minimizing Disk I/O in Two-Bit Breadth-First Search