Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Wolfgang Klebsch

dblp:65/4483 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design
0.011990
Temperature measurement and equilibrium dynamics of simulated annealing placements · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990
Electronic design automation › physical design
placement
0.011990
Temperature measurement and equilibrium dynamics of simulated annealing placements · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990
Electronic design automation › physical design › placement
simulated annealing placement
0.011990
Temperature measurement and equilibrium dynamics of simulated annealing placements · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1990

Methods — techniques the papers use, named apart from their topics

simulated annealing · 0.0cost function distribution analysis · 0.0
YearPublicationVenuePosition
1990 Temperature measurement and equilibrium dynamics of simulated annealing placements
abstract
One way to alleviate the heavy computation required by simulated annealing placement algorithms is to replace a significant fraction of the higher or middle temperatures with a faster heuristic, and then follow it with simulated annealing. A crucial issue in this approach is the determination of the starting temperature for the simulated annealing phase-a temperature should be chosen that causes an appropriate amount of optimization to be done, but makes good use of the structure provided by the heuristic. A method for measuring the temperature of an existing placement is presented. The approach is based on the measurement of the probability distribution of the change in cost function, P( Delta C), and makes the assumption that the placement is in simulated annealing equilibrium at some temperature. The temperature of placements produced by both a simulated annealing and a min-cut placement algorithm are measured, and good agreement with known temperatures is obtained. The P( Delta C) distribution is also used to give an interesting view of the equilibrium dynamics of simulated annealing.>
Jonathan Rose, Wolfgang Klebsch
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
1988 Temperature measurement of simulated annealing placements
abstract
One way to reduce the computational requirements of simulated annealing placement algorithms is to use a faster heuristic to replace the early phase of simulated annealing. Such systems need to know the starting temperature for the annealing phase that makes the best use of the existing structure, yet provides an appropriate amount of improvement. A method for determining the temperature of an existing placement from an analysis of the probability distribution of the change in cost function is presented. Using this view, a novel definition of equilibrium is given and the equilibrium temperature of a placement is defined. Temperatures of placements produced both by a simulated annealing and a min-cut placement algorithm are measured.>
Jonathan Rose, Wolfgang Klebsch
ICCAD2