![NP-complete problems / Cubes / Hypercube / Parallel computing / Shortest path problem / Heuristic / Graph partition / Algorithm / Mathematics / Theoretical computer science / Computational complexity theory NP-complete problems / Cubes / Hypercube / Parallel computing / Shortest path problem / Heuristic / Graph partition / Algorithm / Mathematics / Theoretical computer science / Computational complexity theory](https://www.pdfsearch.io/img/2c6929626f5b2fb3f404f58066c4449d.jpg) Date: 2006-07-06 10:53:25NP-complete problems Cubes Hypercube Parallel computing Shortest path problem Heuristic Graph partition Algorithm Mathematics Theoretical computer science Computational complexity theory | | An E cient Mean Field Annealing Formulation for Mapping Unstructured? Domains to Hypercubes Cevdet Aykanat and I_smail Haritaoglu Computer Engineering Department, Bilkent University, Ankara, Turkey [removed]Add to Reading ListSource URL: www.cs.bilkent.edu.trDownload Document from Source Website File Size: 182,82 KBShare Document on Facebook
|