نتایج جستجو برای: linear arrangement
تعداد نتایج: 515835 فیلتر نتایج به سال:
* Department of Mathematics and Computer Science, Chulalongkorn University. Abstract The winner determination problem (WDP) for a single object auction is a relatively easy problem to solve using the greedy algorithm. However, a booth auction is one of the nonidentical multiple-object auctions which is NP-hard problem. Formulation of the winner determination model for a linear arrangement of a ...
This study aims to determine how the influence of product quality and arrangement on repurchase intentions at Indomaret Pagar Alam. research method is quantitative. The sample in this were 70 respondents who consumers sampling used by researcher incidental sampling. Data analysis multiple linear regression technique which was processed using SPSS V.23 application. results showed, t test variabl...
We study the quantum phase transition of interacting electrons in quantum wires from a one-dimensional (1D) linear configuration to a quasi-1D zigzag arrangement using quantum Monte Carlo methods. As the density increases from its lowest values, first, the electrons form a linear Wigner crystal, then, the symmetry about the axis of the wire is broken as the electrons order in a quasi-1D zigzag ...
It is well-known that the sensor characteristics and their physical arrangement place fundamental limitations on the ultimate capabilities of an array system. In this paper, the design of linear arrays, tailored to the so-called direction-finding (DF) algorithms, is considered. The proposed design approach is superresolution based on the differential geometry of the . The novel concept of a is ...
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a natural notion of flip between these arrangements and study the graph of these flips. In particular, we provide an enumeration algorithm for arrangements with a given support, based on the properties of certain greedy pseudoline arrangements and on their connection with sorting networks....
Molecular arrangement and transition in the domain boundary of a chiral two-dimensional assembly is clearly revealed by high-resolution STM images on an HOPG surface and a linear dislocation formed by molecular trimers and located at opposite chiral domains is found to directly reverse the chirality on DTCD self-assembly.
This work was started as an attempt to apply theory from noncommutative graded algebra to questions about the holonomy algebra of a hyperplane arrangement. We soon realized that these algebras and their deformations, which form a class of quadratic graded algebras, have not been studied much and yet are interesting to algebra, arrangement theory and combinatorics. Let X be a topological space h...
Our object of study is an abelianization of the Sn permutation action on R n that is provided by a particular De Concini-Procesi wonderful model for the braid arrangement. Our motivation comes from an analogous construction for finite group actions on complex manifolds, due to Batyrev [B1, B2], and subsequent study of Borisov & Gunnells [BG], where the connection of such abelianizations with De...
In this paper, we show that the shortest path between two points in a grid-like arrangement of two pencils of lines has a particularly simple structure, as was previously conjectured. This gives a linear-time algorithm for computing shortest paths in such arrangements.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید