| Document Date: 2016-03-26 12:56:25
Open Document File Size: 197,32 KBShare Result on Facebook
City Bethlehem / / Company IBM / / / Event Reorganization / / Facility Library Design / BiCePS library / Abstract Library / Clemson University / Lehigh University / / IndustryTerm large-scale parallel search / distributed-memory computing environments / search process / search node / tree search / parallel algorithms / feasible integer solutions / parallel search handling / software employing branch / tree search algorithms / end product / search order / bound algorithms / separation algorithms / software packages / data-intensive algorithms / related software / knowledge broker / search tree node / bound algorithm / feasible solution / integer solutions / important applications / telecommunications / search nodes / data-intensive applications / sequential algorithm / basic search tree management / search tree / fractional solution / parallel algorithm / search tree nodes / search handling layer / primal solution / / NaturalFeature ALPS / / Organization National Science Foundation / S. Suppose / Lehigh University / Clemson University / Department of Industrial and Systems Engineering / / Person Idle Time (Handshaking) / / / Position designated worker / Traveling Salesman / knowledge-base manager / knowledge broker / / ProgrammingLanguage C++ / / ProvinceOrState New York / Pennsylvania / South Carolina / / Technology underlying algorithm / tree search algorithms / API / parallel algorithm / implementing parallel BCP algorithms / sequential algorithm / load balancing / data-intensive algorithms / separation algorithms / related algorithm / BCP algorithm / / URL http /
SocialTag |
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms T. K. Ralphs∗, L. Lad´anyi†, and M. J. Saltzman‡ Revised February 1, 2004 Abstract