نتایج جستجو برای: thomas algorithm
تعداد نتایج: 778555 فیلتر نتایج به سال:
References [1] Leonidas Fegaras. A new heuristic for optimizing large queries. [2] Toshihide Ibaraki and Tiko Kameda. On the optimal nesting order for computing n-relational joins. Optimizing large join queries using a graph-based approach. [5] Guido Moerkotte and Thomas Neumann. Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees wi...
Branch decompositions were introduce by Robertson and Seymour 3] in their series of papers that proved Wagner's Conjecture. Branch decomposition can be used to solve NP-complete problems modeled on graphs but nding optimal branch decompositions of graphs is also NP-complete. We propose a practical implementation of an algorithm of Sey-mour and Thomas 4] for computing optimal branch decompositio...
In this paper we present an a-posteriori error estimator for the mixed formulation of a linear parabolic problem, used for designing an efficient adaptive algorithm. Our space-time discretization consists of lowest order Raviart-Thomas finite element over graded meshes and discontinuous Galerkin method with variable time step. Finally, several examples show that the proposed method is efficient...
We design and analyze multigrid methods for the saddle point problems resulting from Raviart-Thomas-Nédélec mixed finite element methods (of order at least 1) for the Darcy system in porous media flow. Uniform convergence of the W -cycle algorithm in a nonstandard energy norm is established. Extensions to general second order elliptic problems are also addressed.
Building on [4], [8] and [9] we study which cardinals are characterizable by a Scott sentence, in the sense that φM characterizes κ, if it has a model of size κ, but not of κ. We show that if אα is characterizable by a Scott sentence and β < ω1, then אα+β is characterizable by a Scott sentence. If 0 < γ < ω1, then the same is true for 2אα+γ . Also, אא0 α is characterizable by a Scott sentence. ...
We extend the Billera–Ehrenborg–Readdy map between the intersection lattice and face lattice of a central hyperplane arrangement to affine and toric hyperplane arrangements. For arrangements on the torus, we also generalize Zaslavsky’s fundamental results on the number of regions.
A reduction process to construct hidden hierarchies corresponding to the Gelfand– Dickey ones is outlined in a specific example, not yet treated in the literature.
خفاش دم‌موشی مسقطی Thomas, 1903 muscatellum Rhinopoma یکی از شش گونۀ خانوادۀ خفاش‌های دم‌موشی (Rhinopomatidae) است که قدیمی‌ترین خردخفاش‌های زنده هستند. این گونه در عمان، ایران، امارات، افغانستان، پاکستان، هند و یمن پراکنش و پراکندگی گسترده‌ای از جنوب تا غرب و شرق کشور ایران دارد و حداقل از 52 مکان در بخش جنوبی این کشور گزارش شده است. جایگاه آرایه‌شناختی این گونه در ایران چندان روشن نیست و پژ...
We show that א2 ≤ b < g is consistent. This work is dedicated to James Baumgartner on the occasion of his
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید