نتایج جستجو برای: set splitting problem

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

Journal: :Int. J. Comput. Geometry Appl. 2012
Mark de Berg Amirali Khosravi

An optimal bsp for a set S of disjoint line segments in the plane is a bsp for S that produces the minimum number of cuts. We study optimal bsps for three classes of bsps, which differ in the splitting lines that can be used when partitioning a set of fragments in the recursive partitioning process: free bsps can use any splitting line, restricted bsps can only use splitting lines through pairs...

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...

Davood Hashemabadi Shahla Dashtbany Shahram Sedaghat hoor

The aim of this study is investigation on effect of stem end splitting and Geranium essential oil on vase life on quality of cut chrysanthemum (Dendranthema grandiflorum L.). This experiment arranged as factorial based on RCD with 2 factors of stem end splitting at 2 levels (with splitting and without splitting) and Geranium essential oil at 6 levels (0, 1, 2, 4, 8 and 10 %), with 12 treatments...

2010
Mark de Berg Amirali Khosravi

An optimal bsp for a set S of disjoint line segments in the plane is a bsp for S that produces the minimum number of cuts. We study optimal bsps for three classes of bsps, which differ in the splitting lines that can be used when partitioning a set of fragments in the recursive partitioning process: free bsps can use any splitting line, restricted bsps can only use splitting lines through pairs...

Journal: :journal of computer and robotics 0
omid sojodishijani faculty of computer and information technology engineering, qazvin branch, islamic azad university, qazvin, iran nader rezazadeh faculty of computer and information technology engineering, qazvin branch, islamic azad university, qazvin, iran

nowadays, hidden markov models are extensively utilized for modeling stochastic processes. these models help researchers establish and implement the desired theoretical foundations using markov algorithms such as forward one. however, using stability hypothesis and the mean statistic for determining the values of markov functions on unstable statistical data set has led to a significant reducti...

Journal: :computational methods for differential equations 0
rahmat darzi department of mathematics, neka branch, islamic azad university, neka, iran bahram agheli department of mathematics, qaemshahr branch, islamic azad university, qaemshahr, iran

in this article, we verify existence and uniqueness of positive and nondecreasing solution for nonlinear boundary value problem of fractional differential equation in the form d_{0^{+}}^{alpha}x(t)+f(t,x(t))=0, 0x(0)= x'(0)=0, x'(1)=beta x(xi), where $d_{0^{+}}^{alpha}$ denotes the standard riemann-liouville fractional derivative, 0an illustrative example is also presented.

Journal: :CoRR 2017
Shana Moothedath Prasanna Chaporkar Madhu N. Belur

This paper is about minimum cost constrained selection of inputs and outputs in structured systems for generic arbitrary pole placement. The input-output set is constrained in the sense that the set of states that each input can influence and the set of states that each output can sense is pre-specified. Our goal is to optimally select an input-output set that the system has no structurally fix...

2010
Rebecca M. Steiner

For a computable field F , the splitting set SF of F is the set of polynomials with coefficients in F which factor over F , and the root set RF of F is the set of polynomials with coefficients in F which have a root in F . Results of Frohlich and Shepherdson in [3] imply that for a computable field F , the splitting set SF and the root set RF are Turing-equivalent. Much more recently, in [6], M...

Journal: :Physics Letters B 2021

Maybe the biggest puzzle in grand unified theories (GUTs) is apparent large splitting of doublet and triplet Higgs masses. We suggest a novel mechanism to solve this puzzle, which relies on clockwork generate hierarchies from order-one numbers. The tension between gauge coupling unification proton lifetime minimal SU(5) GUTs also removed scenario, theory remains perturbative until Planck scale....

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

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