Search | Science Publications

Research ArticleOpen accessIn the abstractSimulated Annealing with Deterministic DecisionsTaisir EldosProblem statement: Simulated Annealing (SA) algorithms have been used in solving a wide range of discrete optimization problems for many years, with well know drawbacks like the computational time and difficulties related to the parameters settings. One of the other issues that open the door for research is the acceptance decision that provides for hill climbing; the standard SA algorithms … …Journal of Computer Science, Vol. 5, Issue 12 · 31 Dec 2009 · 7,119 accessesView PDF Cite

Research ArticleOpen accessIn the abstractSolving the State Assignment Problem Using Stochastic Search Aided with Simulated AnnealingWalid M. AlyProblem statement: Solving the state assignment problem means finding the optimum assignment for each state within a sequential digital circuit. These optimum assignments will result in decreasing the hardware realization cost and increasing the reliability of the digital circuit. Unfortunately, the state assignment problem belongs to the class of nondeterministic polynomial time problems (NP complete) which requires heavy computations. Different … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 31 Dec 2009 · 6,966 accessesView PDF Cite

12 articles for “Neighborhood Search”