Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
NP Complete problems are one of the most complex problems in computer science but their vast applications in real world always pushes the scientists to explore new ways to solve them. We extended the original problem definition of Boolean Satisfiability Problem to finding all satisfiable solutions of a given problem instance and used massively parallel architecture of CUDA (Compute Unified Device...
In this paper we present a sorting algorithm, which uses the methodology of insertion sort efficiently to give a much better performance than the existing sorting algorithms of the O(n2 ) class. We prove the correctness of the algorithm and give a detailed time complexity analysis of the algorithm. We also describe various applications of the algorithms.
It is known that insertion sort performs better on almost sorted arrays than other O(n2 ) sorting algorithms. In this paper we develop a bi-partitioned insertion algorithm for sorting, which out beats all other O(n2 ) sorting algorithms in general cases. The graphs of total time taken by different sorting algorithms confirm the superiority of our algorithm over other existing similar algorithms. We...
Sorting is a very well known problem in computer science. It means arranging the data in either increasing or decreasing order. Here we present a new comparison based sorting algorithm whose complexity is theoretically shown to be O(n2).However graphs of total time taken by different sorting algorithms confirms the superiority of our algorithm over other existing similar algorithms. We have also proved...
The set-covering problem has been widely used to model many real world applications. In this paper, we formulate a time-dependent set covering problem, viz., dynamic set-covering (DSC), which involves a series of coupled set-covering problems over time. We motivate the DSC problem from the viewpoint of a fault diagnosis problem, wherein multiple faults may evolve over time and the fault-test dependencies...
This paper considers the problem of temporally fusing classifier outputs to improve the overall diagnostic classification accuracy in safety-critical systems. Here, we discuss dynamic fusion of classifiers which is a special case of the dynamic multiple fault diagnosis (DMFD) problem [1]-[3]. The DMFD problem is formulated as a maximum a posteriori (MAP) configuration problem in tri-partite graphical...
Multiple reference frames and variable block sizes improve compression efficiency of H.264, however, they also increase the encoder complexity and motion estimation time. This paper proposes a new algorithm, called local reference with early termination (LRET) to reduce the H.264 motion estimation time without adding to the encoder complexity. The LERT algorithm rearranges the search order of the...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.