نتایج جستجو برای: grossmann algorithm
تعداد نتایج: 754213 فیلتر نتایج به سال:
This talk describes a proposal, due to Hull, for a conformally invariant limit of superstring theory in six dimensions. Talk presented at the Ninth Marcel Grossmann Meeting (MG9) Work supported in part by the U.S. Dept. of Energy under Grant No. DE-FG03-92-ER40701.
In this issue of Neuron, Grossmann et al. provide the first evidence of voice-sensitive regions in the brain of 7-month-old, but not 4-month-old, infants. We discuss the implications of these findings for our understanding of cerebral voice processing in the first months of life.
The dynamics of the protein–protein interaction network and how it responds to biological perturbations remain difficult to assay by most traditional techniques. A novel kinase-dependent yeast two‐hybrid framework by Stelzl and colleagues (Grossmann et al, 2015) provides a new prism to study how tyrosine phosphorylation regulates the changes in the interactome under varying conditions.
In this paper we consider the synthesis of process networks with time-varying uncertain yields in which investment in pilot plants can be considered to reduce uncertainty of the yields. We formulate this problem as a multistage stochastic program with decision dependent elements where investment strategies are considered to reduce uncertainty, and time-varying distributions are used to describe...
The quantum theory of General Relativity at low energy exists and is of the form called ”effective field theory”. In this talk I describe the ideas of effective field theory and its application to General Relativity. Invited plenary talk at the Eighth Marcel Grossmann Conference on General Relativity, Jerusalem, June 1997, to be published in the proceedings.
An Approach to the Representation of Gradual Uncertainty Resolution in Stochastic Multiperiod Planning Vicente Rico-Ramirez, Ignacio E. Grossmann, Bora Tarhan, Salvador Hernández-Castro and Juan G. Segovia-Hernández Instituto Tecnologico de Celaya, Av. Tecnologico y Garcia Cubas S/N, Celaya,Gto., 38060, Mexico, [email protected] Carnegie Mellon Uiniversity, Pittsburgh, PA, 15213, USA Univ...
This paper addresses the solution of a cardinality boolean quadratic programming problem using three different approaches. The first transforms the original problem into six Mixed-Integer Linear Programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks....
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید