نتایج جستجو برای: nearly optimal programming

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

Journal: :Mathematical Programming Computation 2022

Shape restricted statistical estimation problems have been extensively studied, with many important practical applications in signal processing, bioinformatics, and machine learning. In this paper, we propose study a generalized nearly isotonic optimization (GNIO) model, which recovers, as special cases, classic shape constrained regression, such regression unimodal problems. We develop an effi...

Journal: :مدیریت صنعتی 0
عالیه کاظمی استادیار مدیریت صنعتی، دانشکده مدیریت، دانشگاه تهران، تهران، ایران محمد رضا مهرگان استاد مدیریت صنعتی، دانشکده مدیریت، دانشگاه تهران، تهران، ایران حامد شکوری گنجوی دانشیار دانشگاه تهران، گروه مهندسی صنایع، تهران، ایران

this research presents a mathematical model for oil and gas optimal allocation to different sectors in iran using operations research techniques. sectors are residential and commercial, transportation, industries, agriculture, exports, injection to oil reservoirs and power plans as a secondary energy producer. optimal allocation of energy resources to end-uses from 2011 to 2021 has been done us...

Journal: :Journal of Differential Geometry 2005

Journal: :Information Processing & Management 2004

2007
Benny Sudakov Jan Vondrák

In this paper we show how to find nearly optimal embeddings of large trees in several natural classes of graphs. The size of the tree T can be as large as a constant fraction of the size of the graph G, and the maximum degree of T can be close to the minimum degree of G. For example, we prove that any graph of minimum degree d without 4-cycles contains every tree of size ǫd and maximum degree a...

Journal: :IEEE Transactions on Signal Processing 2017

Journal: :Linear Algebra and its Applications 2021

In this paper we analyze the nearly optimal block diagonal scalings of rows one factor and columns other in triangular form SR decomposition. The result is a generalization van der Sluis about almost general rectangular matrices.

Journal: :SIAM Journal on Computing 2022

For positive integers $U$, $n$, and $\sigma$, given a set $S$ of $n$ (distinct) keys from key space $[U]$, each associated with value $[\sigma]$, the static dictionary problem asks one to preprocess these (key, value) pairs into data structure, supporting value-retrieval queries: for any $x\in [U]$, ${valRet}(x)$ must return $x$ if S$, or $\bot$ $x\notin S$. The special case where $\sigma=1$ is...

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

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