نتایج جستجو برای: space complexity

تعداد نتایج: 780697  

Journal: :International Journal of Research in Engineering and Technology 2014

Journal: :نشریه دانشکده فنی 0
پرهام پهلوانی محمودرضا دلاور فرهاد صمدزادگان

multi-criteria shortest path problems (mspp) are called as np-hard. for mspps, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. this paper describes the development ...

Journal: :مهندسی صنایع 0
الهه قضاوی مهندسی صنایع - دانشگاه یزد محمد مهدی لطفی مهندسی صنایع - دانشگاه یزد محمد حسین ابویی مهندسی صنایع - دانشگاه یزد محمد صابر فلاح نژاد مهندسی صنایع - دانشگاه یزد

asimulation-optimization approach is proposed for replenishment planning andshelf space allocation. the customers’ demand is divided into fixed andvariable demand. each customer follows a given path while shopping in thestore. by dividing the store space into several zones and calculating therelated substantial and random utilities, an analytical equation is proposedfor the probability of zone ...

Parabolic scaling and anisotropic dilation form the core of famous multi-resolution transformations such as curvelet and shearlet, which are widely used in signal processing applications like denoising. These non-adaptive geometrical wavelets are commonly used to extract structures and geometrical features of multi-dimensional signals and preserve them in noise removal treatments. In discrete s...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علوم پایه دامغان 1390

the space now known as complete erdos space ec was introduced by paul erdos in 1940 as the closed subspace of the hilbert space ?2 consisting of all vectors such that every coordinate is in the convergent sequence {0} ? { 1 n : n ? n}. in a solution to a problem posed by lex g. oversteegen we present simple and useful topological characterizations of ec. as an application we determine the ...

In this paper, a sparse representation based manifold learning method is proposed. The construction of the graph manifold in high dimensional space is the most important step of the manifold learning methods that is divided into local and gobal groups. The proposed graph manifold extracts local and global features, simultanstly. After construction the sparse representation based graph manifold,...

Impossible differential cryptanalysis, the extension of differential cryptanalysis, is one of the most efficient attacks against block ciphers. This cryptanalysis method has been applied to most of the block ciphers and has shown significant results. Using structures, key schedule considerations, early abort, and pre-computation are some common methods to reduce complexities of this attack. In ...

SAR imaging systems are as a complement to passive remote sensing but the process of image formation in this systems is so complex So that the final image in the system is formed after the three basic steps: raw data acquisition, forming the signal space and image space. In addition, various factors within the system and outside the system are involved in the information that recorded by SAR, s...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید