Back to Results
First PageMeta Content
NP-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 List

Document Date: 2006-07-06 10:53:25

Open Document

File Size: 182,82 KB

Share Result on Facebook

Company

Graph D P KL SA / KL SA / Boeing / Vertex / /

Country

Turkey / /

/

Event

Product Issues / Product Recall / /

Facility

Bilkent University / /

IndustryTerm

Simultaneous single-hop communications / interconnection network / erent processors / energy function / simultaneous multi-hop communications / energy term corresponding / distant processors / 2D processors / suboptimal solutions / neural networks / individual processor / Energy formulation / energy term / static and dynamic interconnection networks / proposed energy function / energy / /

Organization

KL SA / Commission of the European Communities / Bilkent University / Ankara / /

Person

Hyp / /

Position

Directorate General / General / /

Product

d=0 / /

ProgrammingLanguage

LaTEX / /

Technology

erent processors / P=2 processors / two processors / exactly one processor / individual processor / 2D processors / /

SocialTag