Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A new mapping heuristic based on mean field annealing

From MaRDI portal
Publication:1208578
Jump to:navigation, search

DOI10.1016/0743-7315(92)90013-DzbMath0786.68011OpenAlexW1965866956MaRDI QIDQ1208578

Tevfik Bultan, Cevdet Aykanat

Publication date: 16 May 1993

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-7315(92)90013-d


zbMATH Keywords

simulated annealingparallelismmean field annealingmapping problemKernighan-Lin heuristic


Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)





This page was built for publication: A new mapping heuristic based on mean field annealing

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1208578&oldid=13272863"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 07:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki