Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag. Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization. In M. H. Hamza, editor, Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, Innsbruck, Austria, February 17-19, 2004. pages 649-654, IASTED/ACTA Press, 2004.

This author has not been identified. Look up 'Faisal N. Abu-Khzam' in GoogleThis author has not been identified. Look up 'Michael A. Langston' in GoogleThis author has not been identified. Look up 'Pushkar Shanbhag' in Google

runs on WebDSL