نتایج جستجو برای: product reformulation
تعداد نتایج: 284832 فیلتر نتایج به سال:
It is well known that search-space reformulation can improve the speed and reliability of numerical optimization in engineering design. We argue that the best choice of reformulation depends on the design goal, and present a technique for automatically constructing rules that map the design goal into a reformulation chosen from a space of possible reformulations. We tested our technique in the ...
The problem of how t,o design mukiproduct batch plant,s for the case of uncertain product demands described by any continuous/discrete probability distributional form, is considered in this paper. Based on a stochastic programming formulation, featuring an objective function comprising investment costs for equipment sizing, expected revenues from product sales and a pena.lty term accounting for...
Shuffle projection is motivated by the verification of safety properties of special parameterized systems. Basic definitions and properties, especially related to alphabetic homomorphisms, are presented. The relation between iterated shuffle products and shuffle projections is shown. A special class of multi-counter automata is introduced, to formulate shuffle projection in terms of computation...
Abstract: This is the first of two articles devoted to a exposition of the generatingfunction method for computing fusion rules in affine Lie algebras. The present paper is entirely devoted to the study of the tensor-product (infinite-level) limit of fusions rules. We start by reviewing Sharp’s character method. An alternative approach to the construction of tensor-product generating functions ...
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Today, automated theorem provers are not able to take advantage of database query engines and therefore do not routinely leverage that source of power. Extensional Reasoning (ER) is an approach to automated theorem provi...
In this paper, we define an abstract formal model of dynamic constraints and show that, if the schema is modifiable, the constraints can always be reformulated to Markov constraints.
Abstract Reformulation is remarkably frequent in discourse and has been the subject of much work spoken languages, both on written oral data. Because its metalinguistic nature, combined with general aim clarifying an expression, act reformulation offers a window to way speakers process adjust their expression discourse. However, date, study hardly taken into account now increasingly recognized ...
A so-called Standard Bi-Quadratic Optimization Problem (StBQP) consists in minimizing a bi-quadratic form over the Cartesian product of two simplices (so this is different from a Bi-Standard QP where a quadratic function is minimized over the same set). An application example arises in portfolio selection. In this paper we present a bi-quartic formulation of StBQP, in order to get rid of the si...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید