نتایج جستجو برای: algorithm complexity
تعداد نتایج: 978080 فیلتر نتایج به سال:
Abstract Simulated tempering is a popular method of allowing Markov chain Monte Carlo algorithms to move between modes multimodal target density $\pi$ . Tawn, Moores and Roberts (2021) introduces the Annealed Leap-Point Sampler (ALPS) allow for rapid movement modes. In this paper we prove that, under appropriate assumptions, suitably scaled version ALPS algorithm converges weakly skew Brownian ...
Engineering optimization needs easy-to-use and efficient optimization tools that can be employed for practical purposes. In this context, stochastic search techniques have good reputation and wide acceptability as being powerful tools for solving complex engineering optimization problems. However, increased complexity of some metaheuristic algorithms sometimes makes it difficult for engineers t...
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
The problem of the distribution of dairy products, which is classified as a combinatorial optimization problem, cannot be solved in polynomial time. In this paper, an algorithm based on Ant Colony Hybrid meta-heuristic system and Geographic Information System (GIS) was used to find a near-optimal solution to this problem. Using the former method, the nearest neighbor heuristic algorithm was use...
In this paper we consider to embed a tree T with N vertices on a set of N points inside a simple polygon on n vertices and the goal is to minimize the number of bends. The main idea of our algorithm is modeling the problem into graph matching problem and uses the graph matching algorithms. We apply the concept of error-correction transformation and find the appropriate cost function then we per...
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
in this paper, an adaptive neuro fuzzy sliding mode based genetic algorithm (anfsga) controlsystem is proposed for a ph neutralization system. in ph reactors, determination and control of ph isa common problem concerning chemical-based industrial processes due to the non-linearity observedin the titration curve. an anfsga control system is designed to overcome the complexity of precisecontrol o...
one of the most common signals used for achieving high range resolution in radar is stepped-frequency signals. when a target is stationary in these radars, dft (discrete fourier transform) based processing is used to attain high range resolution profile (hrrp). however, in the case of moving target, due to spreading of the echo signal spectrum, dft based processing is not optimal and decreases ...
This study extends a mathematical model that integrates the location, allocation, inventory replenishment and routing decisions simultaneously. To cope with inherent uncertainty of parameters, we implement a continuous-time Markov process and derive the performance measures of the system. Using the obtained results, the problem is formulated as a mixed integer nonlinear programing model (MINLP)...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید