نتایج جستجو برای: nondefinite problem
تعداد نتایج: 880209 فیلتر نتایج به سال:
markov chain anticipation for the online traveling salesman problem by simulated annealing algorithm
the arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. the policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. in on-line created tours arc costs are not available for decision makers. the on-line traversed nodes are f...
abstract: mineral scaling in oil and gas production equipment is one of the most important problem that occurs while water injection and it has been recognized to be a major operational problem. the incompatibility between injected and formation waters may result in inorganic scale precipitation in the equipment and reservoir and then reduction of oil production rate and water injection rate. ...
we present a matching and lp based heuristic algorithm that decides graph non-hamiltonicity. each of the n! hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices p, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. a graph instance (g) is initially coded as exclusion set ...
در این پایان نامه روشی را براساس گروه تقارن و استفاده از جبر لی برای بدست آوردن جوابهای تحلیلی معادلات دیفرانسیل بررسی می کنیم و جوابهای تحلیلی چند معادله دیفرانسیل مشهور مانند گرما، موج و کی دی وی و غیره را مورد مطالعه قرار می دهیم. سپس از تئوری jet و علامتگذاری گستردهتری از معادلات دیفرانسیل قابل استفاده برای فرمول بندی این مفاهیم از نرم افزار maple استفاده می کنیم. هدف اصلی این کار قا...
a total of 150 day old female chickens (ross 308) were randomly allocated to 2 groups with 5 replicate and 15 chicks in each replicate to determine the effects of cold induced ascites on performance, antioxidant status, blood enzyme activities and bone metabolism. the two experimental treatments were: 1) chicks that reared under normal temperature (nt) and 2) chicks that reared under cold tempe...
In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید