نتایج جستجو برای: permutation approach
تعداد نتایج: 1303074 فیلتر نتایج به سال:
Permutation flow shop scheduling problem (PFSP) is a well-known NP-hard with extensive engineering relevance. Consequently, various meta-heuristics have been proposed to obtain near optimum solutions. However, most of them involve tuning algorithm-specific parameters, which leads excessive computational complexities. A recently developed meta-heuristic named Jaya algorithm simple yet efficient ...
We present the new LICAD algorithm to solve the permutation problem of the ICA in the frequency domain and improve the separation quality. In the proposed algorithm, first, the sources' angles are estimated in each frequency bin using an ICA separating matrix. Then, these estimates are compared to the true values obtained from a pre-processing stage. If the difference among similar angles is le...
In this paper a novel approach for matrix manipulation and indexing is proposed .Here the elements in a row of matrix are designated by numeric value called ‘permutation index’ followed by the elements of the row being randomised. This is done for all the rows of the matrix and in the end the set of permutation indices are put in the parent matrix and random locations depending on a pre decided...
Permutation of class labels is a common approach to build null distributions for significance analyis of microarray data. It is assumed to produce random score distributions, which are not affected by biological differences between samples. We argue that this assumption is questionable and show that basic requirements for null distributions are not met. We propose a novel approach to the signif...
SUMMARY Cook, Gold, and Li (2007, Biometrics 63, 540-549) extended the Kulldorff (1997, Communications in Statistics 26, 1481-1496) scan statistic for spatial cluster detection to survival-type observations. Their approach was based on the score statistic and they proposed a permutation distribution for the maximum of score tests. The score statistic makes it possible to apply the scan statisti...
Permutation routing is a popular communication pattern in the interconnection networks. Most of the previously proposed routings algorithms on Multistage Interconnection Networks (MINs) work on 2×2 switches. We considered alloptical rearrangeable permutation routing for Clos Interconnection networks. The signal in the optical switch with the same wavelength will cause the crosstalk problem.In t...
This paper presents a robust and precise method for solving the permutation problem of frequency-domain blind source separation. It is based on two previous approaches: the direction of arrival estimation approach and the inter-frequency correlation approach. We discuss the advantages and disadvantages of the two approaches, and integrate them to exploit the both advantages. We also present a c...
We propose statistical methods for comparing phenomics data generated by the Biolog Phenotype Microarray (PM) platform for high-throughput phenotyping. Instead of the routinely used visual inspection of data with no sound inferential basis, we develop two approaches. The first approach is based on quantifying the distance between mean or median curves from two treatments and then applying a per...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید