نتایج جستجو برای: iteratedlocal search
تعداد نتایج: 294701 فیلتر نتایج به سال:
The search designs first introduced in Srivastava (1975) is reviewed. In a ceritan problem, there may be some search designs with same runs. Some criteria for evaluation of search designs are the other topic in the paper. Criteria based on searching probability and expected Kullback- Leibler are reviewd. Some examples are given in each case.
In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...
مقدمه: با نوشتن یک کد خاص براساس تکنیک Grid search طیف انرژی عناصر بررسی شده است. این روش را میتوان برای بررسی طیفهای اتمی، مولکولی و هستهای، پالسهای لیزر و مطالعه طیفهایی که از برهمکنش لیزر با سلولها و اجزاء مختلف انسانی بهدست میآید، بهکار برد. طیف میکرورامان لنزهای چشمی برازششده توسط De.Mul و طیف زمانی برازش شده با نرمافزار gnuplot یک تکمولکول که با لیزری با طول موج 585 نانومتر...
one of methods of improvement of the material flow is cross docking that in is considered as a good method to reduce inventory and improve customer satisfaction. too, the vehicle routing problem is one of the important problems in distribution management and its goal is to find paths for delivering various cargos. therefore, this study was conducted in order to vehicle routing problem with cros...
augmented downhill simplex method (adsm) is introduced here, that is a heuristic combination of downhill simplex method (dsm) with random search algorithm. in fact, dsm is an interpretable nonlinear local optimization method. however, it is a local exploitation algorithm; so, it can be trapped in a local minimum. in contrast, random search is a global exploration, but less efficient. here, rand...
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
Design of experiments (DOE) offers a great deal of benefits to any manufacturing organization, such as characterization of variables and sets the path for the optimization of the levels of these variables (settings) trough the Response surface methodology, leading to process capability improvement, efficiency increase, cost reduction. Unfortunately, the use of these methodologies is very limite...
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
Today, with rapid growth of the World Wide Web and creation of Internet sites and online text resources, text summarization issue is highly attended by various researchers. Extractive-based text summarization is an important summarization method which is included of selecting the top representative sentences from the input document. When, we are facing into large data volume documents, the extr...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید