نتایج جستجو برای: strong feasible basis

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

1996
Lee Smolin

A string theory in 3 euclidean spacetime dimensions is found to describe the semiclassical behavior of a certain exact physical state of quantum general relativity in 4 dimensions. Both the worldsheet and the three dimensional metric emerge as collective coordinates that describe a sector of the solution space of quantum general relativity. Additional collective coordinates exist which are inte...

1994
Paul J. Voda

We are motivated by nding a good basis for the semantics of programming languages and investigate small classes in subrecursive hierarchies of functions. We do this with the help of pairing functions because in this way we can explore the amazing coding powers of S-expressions of LISP within the domain of natural numbers. In the process of doing this we introduce a missing stage in Grzegorczyk-...

2018
Ming-Deh A. Huang

We construct cryptographic trilinear maps that involve simple, non-ordinary abelian varieties over finite fields. In addition to the discrete logarithm problems on the abelian varieties, the cryptographic strength of the trilinear maps is based on a discrete logarithm problem on the quotient of certain modules defined through the N\'{e}ron-Severi groups. The discrete logarithm problem is reduci...

Journal: :international journal of industrial mathematics 0
z. ‎aghababazadeh‎‎ department of mathematics‎, ‎science and‎ ‎research branches‎, ‎islamic azad university‎, ‎tehran‎, ‎iran‎. m. ‎rostamy-‎malkhalifeh‎‎ department of mathematics‎, ‎science and‎ ‎research branches‎, ‎islamic azad university‎, ‎tehran‎, ‎iran‎.

it is well known that in operations research‎, ‎degeneracy can cause a cycle in a network‎ ‎simplex algorithm which can be prevented by maintaining strong‎ ‎feasible bases in each pivot‎. ‎also‎, ‎in a network consists of n arcs‎ ‎and m nodes‎, ‎not considering any new conditions on the entering‎ ‎variable‎, ‎the upper bound of consecutive degenerate pivots is equal‎ $left( ‎begin{array}{c}‎ ‎n...

GH.R Amin

In many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called “inverse feasible problem”. For a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.

2000
John Gruninger Robert L. Sundberg

A technique has been developed to estimate bounds on the spectra of major constituents of multispectral images. The bounds are two distinct sets of spectra, one in which the spectra are maximally independent from one another and another set in which the spectra are minimally independent. Both sets and their corresponding estimated abundance maps satisfy feasibility constraints for both spectral...

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

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