Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Jueliang Hu"'
Publikováno v:
IEEE Access, Vol 9, Pp 20736-20745 (2021)
Extreme learning machine (ELM) has become popular in recent years, due to its robust approximation capacity and fast learning speed. It is common to add a $\ell _{2}$ penalty term in basic ELM to avoid over-fitting. However, in $\ell _{2}$ -regulariz
Externí odkaz:
https://doaj.org/article/fafb18297010498186406bc0b517cc55
Publikováno v:
Journal of Applied Mathematics, Vol 2014 (2014)
We establish convergence theorems of Newton-Kantorovich type for a family of new modified Halley’s method in Banach space to solve nonlinear operator equations. We present the corresponding error estimate. To show the application of our theorems, t
Externí odkaz:
https://doaj.org/article/a540f6c6690e4290b41c5e99f6156ab7
Publikováno v:
Journal of Textile Science and Technology. :1-19
Publikováno v:
International Conference on Smart Transportation and City Engineering (STCE 2022).
Publikováno v:
Information Sciences
For the creation of intelligent management systems in hospitals, efficient resource arrangement is essential. Motivated by a real-world scenario in hospitals, we introduce the no-wait two-stage flowshop scheduling problem with the first-stage machine
Publikováno v:
Journal of Scheduling. 23:595-608
We study a scheduling environment that finds many real-world manufacturing applications, in which there is a close connection between a hybrid multiprocessor open shop and multiple parallel identical flow shops. In this environment, there is an exten
Publikováno v:
Journal of Combinatorial Optimization. 37:668-684
A two-stage openshop consists of a machine in the first stage and a machine in the second stage; a job processed on the two-stage openshop means it is processed non-preemptively by each of the two machines, in whichever order. We consider the schedul
Publikováno v:
Applied Mathematics-A Journal of Chinese Universities. 32:493-502
In this paper, a new price is given to the online decision maker at the beginning of each day. The trader must decide how many items to purchase according to the current price. We present three variants and an online algorithm based on cost function.
Publikováno v:
Computers & Industrial Engineering. 158:107387
We follow up an earlier studied multiple-task parallel-machine scheduling model that captures the core challenges in MapReduce scheduling, with the optimization goal to minimize the total job completion time. The problem is a novel generalization of
Publikováno v:
Applied Mathematics-A Journal of Chinese Universities. 32:237-252
This paper investigates the online inventory problem with interrelated prices in which a decision of when and how much to replenish must be made in an online fashion even without concrete knowledge of future prices. Four new online models with differ