نتایج جستجو برای: latin hypercube sampling
تعداد نتایج: 243591 فیلتر نتایج به سال:
Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...
We propose symmetric Latin hypercubes for designs of computer exepriment. The goal is to ooer a compromise between computing eeort and design opti-mality. The proposed class of designs has some advantages over the regular Latin hypercube design with respect to criteria such as entropy and the minimum intersite distance. An exchange algorithm is proposed for constructing optimal symmetric Latin ...
A statistical emulator is a fast proxy for a complex computer model which predicts model output at arbitrary parameter settings from a limited ensemble of training data. Regular grid designs for the training set are commonly used for their simplicity. However, Latin hypercube designs have well known theoretical advantages in the design of computer experiments, especially as the dimension of the...
A recently developed Centroidal Voronoi Tessellation (CVT) sampling method is investigated here to assess its suitability for use in statistical sampling applications. CVT efficiently generates a highly uniform distribution of sample points over arbitrarily shaped M-Dimensional parameter spaces. On several 2-D test problems CVT has recently been found to provide exceedingly effective and effici...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید