Results 1  10
of
15
VLSI cell placement techniques
 ACM Computing Surveys
, 1991
"... VLSI cell placement problem is known to be NP complete. A wide repertoire of heuristic algorithms exists in the literature for efficiently arranging the logic cells on a VLSI chip. The objective of this paper is to present a comprehensive survey of the various cell placement techniques, with emphasi ..."
Abstract

Cited by 83 (0 self)
 Add to MetaCart
VLSI cell placement problem is known to be NP complete. A wide repertoire of heuristic algorithms exists in the literature for efficiently arranging the logic cells on a VLSI chip. The objective of this paper is to present a comprehensive survey of the various cell placement techniques, with emphasis on standard ce11and macro
Adapting temperature for some randomized local search algorithms, in preparation
 Proceedings of the First International Conference on Autonomous Agents
, 1998
"... Abstract: A heuristic learning algorithm is introduced to adapt the temperature for a randomized local search procedure based on a Boltzmann machine. Experimental results are given to confirm that the method improves both efficiency and more especially reliability. Further experiments are described ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract: A heuristic learning algorithm is introduced to adapt the temperature for a randomized local search procedure based on a Boltzmann machine. Experimental results are given to confirm that the method improves both efficiency and more especially reliability. Further experiments are described which investigate how the choice of temperature affects the algorithm’s performance. Keywords:optimisation. 1
Improved lower bound on the Shannon capacity of C7," Information Processing Letters 81(5) (2002), 277282. Biographies. Tom Bohman was born in
 Professor of Mathematics at the TechnionIsrael Institute of Technology. He studied at the Hebrew University of Jerusalem, where he obtained his Ph.D. in
, 1969
"... An independent set with 108 vertices in the strong product of four 7cycles (C7 2 C7 2 C7 2 C7) isgiven. This improves the best known lower bound for the Shannon capacity of the graph C7 which is the zeroerror capacity of the corresponding noisy channel. The search was done by a computer program us ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
An independent set with 108 vertices in the strong product of four 7cycles (C7 2 C7 2 C7 2 C7) isgiven. This improves the best known lower bound for the Shannon capacity of the graph C7 which is the zeroerror capacity of the corresponding noisy channel. The search was done by a computer program using the \simulated annealing " algorithm with a constant time temperature schedule.
Learning as Applied to Simulated Annealing
"... Stochastic combinatorial optimization techniques, such as simulated annealing and genetic algorithms, have become increasingly important in design automation as the size of design problems have grown and the design objectives have become increasingly complex. However, stochastic algorithms are often ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Stochastic combinatorial optimization techniques, such as simulated annealing and genetic algorithms, have become increasingly important in design automation as the size of design problems have grown and the design objectives have become increasingly complex. However, stochastic algorithms are often slow since a large number of random design perturbations are required to achieve an acceptable result  they have no builtin "intelligence". In this paper, we show that incremental, statistical learning techniques can improve the quality of results and reduce the number of expensive costfunction evaluations for stochastic optimization for a particular solution quality. In particular, simulated annealing was selected as representative stochastic optimization approach and the cellbased layout placement problem was used to evaluate the utility of such a learningbased approach. In this work, we used regression to learn the properties of the solution space and have tested the trained algori...
Simulated Annealing with Time dependent Energy Function via Sobolev inequalities
 Sobolev Inequalities, Preprint 94069, SFB 343
, 1994
"... We analyze the Simulated Annealing Algorithm with an energy function U t that depends on time. Assuming some regularity conditions on U t (especially that U t does not change too quickly in time), and choosing a logarithmic cooling schedule for the algorithm, we derive bounds on the RadonNikodym de ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We analyze the Simulated Annealing Algorithm with an energy function U t that depends on time. Assuming some regularity conditions on U t (especially that U t does not change too quickly in time), and choosing a logarithmic cooling schedule for the algorithm, we derive bounds on the RadonNikodym density of the distribution of the annealing algorithm at time t with respect to the invariant measure at time t. Moreover we estimate the entrance time of the algorithm into typical subsets V of the state space in terms of ß t (V c ). Keywords: Simulated Annealing, Sobolev inequalities, Spectral gap, Markov processes 1 Introduction Let X be a finite set. The well known Simulated Annealing (SA) algorithm is an inhomogeneous Markov process Y t on X with the aim to minimize a given function U : X ! R. The idea behind SA is to think of U as an energy function and to choose the Markov process in such a way that the transition kernel at time t has at its invariant measure ß t , the Gibbs distrib...
Improved lower bound on the Shannon capacity of . . .
, 2000
"... An independent set with 108 vertices in the strong product of four 7cycles (C7 2 \Theta C7 2 \Theta C7 2 \Theta C7 ) is given. This improves the best known lower bound for the Shannon capacity of the graph C7 which is the zeroerror capacity of the corresponding noisy channel. The search was done b ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
An independent set with 108 vertices in the strong product of four 7cycles (C7 2 \Theta C7 2 \Theta C7 2 \Theta C7 ) is given. This improves the best known lower bound for the Shannon capacity of the graph C7 which is the zeroerror capacity of the corresponding noisy channel. The search was done by a computer program using the "simulated annealing" algorithm with a constant time temperature schedule.
DECLARATION
, 2006
"... I hereby declare that the seminar report entitled “Digital Phase Locked Loop Interface Design ” is an authentic record of my own work carried out as requirements ..."
Abstract
 Add to MetaCart
I hereby declare that the seminar report entitled “Digital Phase Locked Loop Interface Design ” is an authentic record of my own work carried out as requirements
Stochastic Search on Graphs and Genetic Algorithms
, 1994
"... We analyze the convergence of a wide class of Genetic Algorithms by reducing them to a class of stochastic search algorithms on graphs. We show that, if the underlying random walk is irreducible and reversible, the invariant measure has a Gibbsian structure and that a logarithmic cooling schedule si ..."
Abstract
 Add to MetaCart
We analyze the convergence of a wide class of Genetic Algorithms by reducing them to a class of stochastic search algorithms on graphs. We show that, if the underlying random walk is irreducible and reversible, the invariant measure has a Gibbsian structure and that a logarithmic cooling schedule similar to that used in Simulated Annealing guarantees convergence to the uniform distribution on the set of minima of an energy function. Moreover, using spectral gap estimates, we bound the entrance time into typical subsets of the state space stochastically in terms of the Gibbs measure at time t. Keywords: Genetic Algorithms, Spectral gap, Markov processes, Simulated Annealing 1 Introduction In the sequel we are going to give a small contribution to the following well studied problem: Let (X; E) be a finite, but very large graph with vertex set X and edge set E. Let U : X ! R be a real valued function of the vertices. Then the task to find the minimum value of U in reasonable time or, ...
Approved by: ADAPTIVE RANDOM SEARCH METHODS FOR SIMULATION OPTIMIZATION
, 2007
"... To my family. iii ACKNOWLEDGEMENTS I would like to express my sincere gratitude to my thesis advisor Dr. Sigrún Andradóttir for her guidance, support, and constant encouragement that has made this quest a success. I would also like to thank Dr. Hayriye Ayhan, Dr. David Goldsman, Dr. SeongHee Kim, a ..."
Abstract
 Add to MetaCart
To my family. iii ACKNOWLEDGEMENTS I would like to express my sincere gratitude to my thesis advisor Dr. Sigrún Andradóttir for her guidance, support, and constant encouragement that has made this quest a success. I would also like to thank Dr. Hayriye Ayhan, Dr. David Goldsman, Dr. SeongHee Kim, and Dr. Barry L. Nelson for their willingness to serve on my defense committee and for their helpful comments. I am especially grateful to Dr. Nelson for his careful proofreading and his helpful suggestions for improving my work. I am also thankful to Dr. Anton Kleywegt for serving on my proposal committee. times. I also thank my friends for their help, support, and presence in my life during hard Finally, I would like to thank my family for all the sacrifices they have made for me to succeed throughout my life and for their unconditional love and support. I am also thankful to my sister Irina for introducing me to mathematics at an early age.