نتایج جستجو برای: is complicated

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

Journal: :IEEE Computer 2012
David Alan Grier Erin Dian Dumbacher

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور استان تهران - دانشکده علوم ریاضی و مهندسی کامپیوتر 1392

heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان - دانشکده ریاضی 1389

one of the most important number sequences in mathematics is fibonacci sequence. fibonacci sequence except for mathematics is applied to other branches of science such as physics and arts. in fact, between anesthetics and this sequence there exists a wonderful relation. fibonacci sequence has an importance characteristic which is the golden number. in this thesis, the golden number is observed ...

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

in this thesis, ‎‎using‎‎ ‎concept‎s‎ ‎of‎ ‎wavelet‎s‎ ‎theory ‎‎‎som‎e‎ ‎methods‎‎ ‎of‎ ‎th‎e ‎solving‎‎ ‎optimal‎‎ ‎‎con‎tr‎ol‎ problems ‎(ocps)‎‎. ‎g‎overned by time-delay systems is investigated. ‎th‎is‎ thesis contains ‎tw‎o parts. ‎‎first, the method of obtaining ‎o‎f ‎the‎ ‎‎ocps‎ in time delay systems by linear legendre multiwavelets is ‎ ‎presented‎.‎‎‎‎ the main advantage of the meth...

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

this study considers the level of increase in customer satisfaction by supplying the variant customer requirements with respect to organizational restrictions. in this regard, anp, qfd and bgp techniques are used in a fuzzy set and a model is proposed in order to help the organization optimize the multi-objective decision-making process. the prioritization of technical attributes is the result ...

2011
Lauren Cohen Dong Lou Kewei Hou Alan Huang Jennifer Huang Byoung-Hyoun Hwang Owen Lamont Chris Malloy David McLean Christopher Polk Jeremy Stein

We exploit a novel setting in which the same piece of information affects two sets of firms: one set of firms requires straightforward processing to update prices, while the other set requires more complicated analyses to incorporate the same piece of information into prices. We document substantial return predictability from the set of easy-to-analyze firms to their more complicated peers. Spe...

M. V. Dvoynikov M. V. Nutskova, P. A. Blinov

The article discusses researches performed in the Well Drilling Department of the St. Petersburg Mining University. The directions of development of the department are shown. Special attention in this article is paid to research in the field of developing drilling fluids for drilling wells in various mining and geological conditions. It is shown that the gas-liquid mixtures studied by the depar...

1996
Peter Graf Christoph Meyer

Indexing techniques support the retrieval and maintenance of large sets of terms There is also an indexing method called substi tution tree indexing that e ciently handles sets of substitutions We present three advanced indexing operations for substitution trees The multi merge for the simultaneous uni cation of sets of substitutions the subsumption operation on two sets of substitutions and th...

پایان نامه :وزارت بهداشت، درمان و آموزش پزشکی - دانشگاه علوم پزشکی و خدمات بهداشتی درمانی استان کرمانشاه 1370

cml in breif cml is characterized by the proliferation of large numbers of immature wbc in the blood and bone marrow. in most of the patients , it is a clonal disorder in which all cell lines, express the philadelphia chromosome)q/22 translocation(it accounts for 20 of all leukemias and most cases occur over 25 yrs of age. the disease usually begins insidiously,but symptoms referable to anemia ...

1999
Harry Buhrman Leen Torenvliet

Kolmogorov complexity has proven to be a very useful tool in simplifying and improving proofs that use complicated combinatorial arguments. In this paper we use Kolmogorov complexity for oracle construction. We obtain separation results that are much stronger than separations obtained previously even with the use of very complicated combinatorial arguments. Moreover the use of Kolmogorov argume...

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

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