Results 171 to 180 of about 6,417 (238)

Efficacy and safety of camrelizumab plus apatinib in advanced urachal cancer (RUN-SC-0102): a single-arm, multicentre, phase 2 trial in China. [PDF]

EClinicalMedicine
Ju M, Li W, Hu L, Ye X, Yan W, Zhang S.
europepmc   +1 more source

Research on time series prediction model for multi-factor environmental parameters in facilities based on LSTM-AT-DP model. [PDF]

Front Plant Sci
Liang L, Shi H, Wang Z, Wang S, Li C, Diao M.   +5 more
europepmc   +1 more source

Efficient Non-Interactive Discrete ReLU over CKKS Using Interpolation Look-Up Table. [PDF]

Entropy (Basel)
Chen Z, Song X, Chen L.
europepmc   +1 more source

Phase 2 study of cabozantinib (XL184) with nivolumab and ipilimumab for the treatment of poorly differentiated neuroendocrine carcinomas (ETCTN10315). [PDF]

Oncologist
Mandl A, Chen R, Das S, Strosberg JR, Kasi A, Konda B, Li D, Burns TF, Chauhan A, Ciombor KK, Dayyani F, Dorff T, Ohr JP, Patel BB, Sukrithan V, Soares HP, Chen K, Liu SV, Tesfaye AA, Carducci MA, Beumer JH.   +20 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Smooth Optimization Methods for Minimax Problems

SIAM Journal on Control and Optimization, 1988
The classical discrete minimax problem is considered. It is transformed into an equivalent problem by a monotone transformation of the initial functions. It was found that the classical Lagrangian of the equivalent problem has a number of important properties both in primal and dual spaces in convex as well as in nonconvex cases.
openaire   +4 more sources

A barrier function method for minimax problems

Mathematical Programming, 1992
The authors consider the optimization problem to minimize \(\psi(x)\) on \(\mathbb{R}^ n\) where \[ \psi(x):=\max\left(f^ 1(x),\dots,f^ m(x), \max_{t\in[0,1]}\Phi^ 1(x,t),\dots,\max_{t\in[0,1]}\Phi^ \ell(x,t)\right) \] and \(f^ j\), \(j=1,\dots,m\), \(\Phi^ k\), \(k=1,\dots,\ell\), are continuously differentiable functions.
Elijah Polak, J. E. Higgins, David Q. Mayne   +2 more
openaire   +4 more sources

Polygonal approximation by the minimax method

Computer Graphics and Image Processing, 1982
Summary: This paper is concerned with the problem of approximating digitized pictures by polygons. The digitized picture is represented by a two- dimensional array of points, and it is desired to convert the given array into a set of polygons, such that each polygon has the least number of sides and the error between the initial points and the ...
Yoshisuke Kurozumi, Wayne A. Davis
openaire   +3 more sources