Probabilistic Rejectionless Anti-Voter Optimization Algorithm
نویسندگان
چکیده
A new probabilistic algorithm, called Probabilistic Rejectionless Anti-Voter (PRAV), is introduced. Due to its property to concentrate computational efforts on places where there are the greatest chances for the improvement of an objective function and due to the employed rejectionless mechanism a significant speed-up over other probabilistic methods is achieved The extensive superior experimental results with respect to simulated annealing, on both generic NPcomplete problems, and high level synthesis tasks are presented and statistically analyzed. The discussed problems include the novel application of commutativity for design improvement. During the discussion of properties of PRAV, the proof of convergence is presented.
منابع مشابه
A Parallel Algorithm of Boltzmann machine with Rejectionless Method
Parallelization is of great advantage to speed-up of calculation. In this paper, the proposition of parallelizing the rejectionless method [1] is presented. While for this parallelization the efficiency was confirmed with an experiment of TSP and the relationship with the number of cities was analyzed. Key-Word: Boltzmann machine, Hopfied network, simulated annealing, rejectionless method
متن کاملHybrid Probabilistic Search Methods for Simulation Optimization
Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...
متن کاملFault Masking By Probabilistic Voting
In this study, we introduced a probabilistic voter, regarding symbol probabilities in decision process besides majority consensus. Conventional majority voter is independent of functionality of redundant modules. In our study, proposed probabilistic voter is designed corresponding to functionality of the redundant module. We tested probabilistic voter for 3 and 5 redundant modules with random t...
متن کاملProbabilistic Power Distribution Planning Using Multi-Objective Harmony Search Algorithm
In this paper, power distribution planning (PDP) considering distributed generators (DGs) is investigated as a dynamic multi-objective optimization problem. Moreover, Monte Carlo simulation (MCS) is applied to handle the uncertainty in electricity price and load demand. In the proposed model, investment and operation costs, losses and purchased power from the main grid are incorporated in the f...
متن کاملFaster Monte Carlo Simulations at Low Temperatures. The Waiting Time Method
We discuss a rejectionless global optimization technique which, while being technically similar to the recently introduced method of Extremal Optimization, still relies on a physical analogy with a thermalizing system. This method can be used at constant temperature or combined with annealing techniques, and is especially well suited for studying the low temperature relaxation of complex system...
متن کامل