Name
Abstract | ||
|---|---|---|
Placement is an NP-complete problem, thus probabilistic algorithms are usually applied to its resolution. Simulated Annealing (SA) is one of the most successful methods available to treat placement problems. In spite of the wide field of application of SA, the experimentation with new cost functions requires costly studies for fine-tuning the algorithm parameters. In this paper, we present Natural Optimization (NO), a new self-tuning combinatorial optimization method.We suggest a slight variation on the SA method to convert it from a user-adaptive method into a self-adaptive one. The initial temperature is automatically determined, and its cooling is adjusted in a natural way to its fair value during the whole annealing process. We have compared the NO algorithm with a fine-tuned SA-based placement tool. As result, NO arises as a very promising combinatorial optimization method, since simplifies the hard task of parameter adjustment while maintaining the high quality results provided by SA. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/IWRSP.2000.855223 | IEEE International Workshop on Rapid System Prototyping |
Keywords | Field | DocType |
successful method,fine-tuned sa-based placement tool,promising combinatorial optimization method,algorithm parameter,natural optimization,probabilistic algorithm,placement problem,new cost function,user-adaptive method,new self-tuning combinatorial optimization,adaptive fpga placement,sa method,temperature,design automation,cost function,annealing,fair value,probabilistic algorithms,read only memory,computational complexity,field programmable gate arrays,combinatorial optimization,placement,simulated annealing,np complete problem | Simulated annealing,Read-only memory,Mathematical optimization,Combinatorial mathematics,Computer science,Field-programmable gate array,Combinatorial optimization,Probabilistic analysis of algorithms,Electronic design automation,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
1074-6005 | 0-7695-0668-2 | 1 |
PageRank | References | Authors |
0.38 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juan de Vicente | 1 | 7 | 1.72 |
| Juan Lanchares | 2 | 171 | 23.30 |
| Román Hermida | 3 | 89 | 15.34 |