Results 11 to 20 of about 389,923 (287)
Optimal Placement and Sizing of DGs in Distribution Networks Using MLPSO Algorithm
In today’s world, distributed generation (DG) is an outstanding solution to tackle the challenges in power grids such as the power loss of the system that is intensified by the exponential increase in demand for electricity.
Eshan Karunarathne +3 more
doaj +1 more source
Minimizers of Sparsity Regularized Huber Loss Function [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deniz Akkaya, Mustafa Ç. Pınar
openaire +2 more sources
Introduction. Due to the spread of COVID-19 in the world, mathematical modeling of epidemiological processes is an important and relevant scientific problem.
P. Knopov, O. Bogdanov
doaj +1 more source
The distribution system reconfiguration (DSR) is a complex large-scale optimization problem, which is usually formulated with one or more objective functions and should satisfy multiple sets of linear and non-linear constraints.
Meisam Mahdavi +4 more
doaj +1 more source
Core loss resistance impact on sensorless speed control of an induction motor using hybrid adaptive sliding mode observer [PDF]
Induction motors (IMs) experience power losses when a portion of the input power is converted to heat instead of driving the load. The combined effect of copper losses, core losses, and mechanical losses results in IM power losses.
Tadele Ayana +2 more
doaj +1 more source
Making Risk Minimization Tolerant to Label Noise [PDF]
In many applications, the training data, from which one needs to learn a classifier, is corrupted with label noise. Many standard algorithms such as SVM perform poorly in presence of label noise.
Ghosh, Aritra +2 more
core +1 more source
This paper presents an efficient approach for solving the optimal reactive power dispatch problem. It is a non-linear constrained optimization problem where two distinct objective functions are considered.
Zahir Sahli +3 more
doaj +1 more source
Optimal Minimization of the Covariance Loss
Let $X$ be a random vector valued in $\mathbb{R}^{m}$ such that $\|X\|_{2} \le 1$ almost surely. For every $k\ge 3$, we show that there exists a sigma algebra $\mathcal{F}$ generated by a partition of $\mathbb{R}^{m}$ into $k$ sets such that \[\|\operatorname{Cov}(X) - \operatorname{Cov}(\mathbb{E}[X\mid\mathcal{F}]) \|_{\mathrm{F}} \lesssim \frac{1 ...
Vishesh Jain +2 more
openaire +2 more sources
Noise Tolerance under Risk Minimization [PDF]
In this paper we explore noise tolerant learning of classifiers. We formulate the problem as follows. We assume that there is an ${\bf unobservable}$ training set which is noise-free.
Manwani, Naresh, Sastry, P. S.
core +1 more source
Large losses–-probability minimizing approach [PDF]
The probability minimizing problem of large losses of portfolio in discrete and continuous time models is studied. This gives a generalization of quantile hedging presented in [3].
openaire +2 more sources

