Results 11 to 20 of about 1,703,727 (282)
Online Algorithms for Multilevel Aggregation [PDF]
Operations Research, 2020 Online Algorithms for Hierarchical Aggregation Problems Data and inventory aggregation problems arise in multicasting, sensor networks, communication in organization hierarchies, and in supply chain management. These problems are naturally online, in the sense that aggregation decisions need to be made without information about future requests.
Marcin Bienkowski +9 more
openaire +8 more sources
Competitive Algorithms for Online Pricing [PDF]
Discrete Mathematics, Algorithms and Applications, 2011 Given a seller with m amount of items, a sequence of users {u1, u2, ...} come one by one, the seller must set the unit price and assign some amount of items to each user on his/her arrival. Items can be sold fractionally. Each ui has his/her value function vi(ċ) such that vi(x) is the highest unit price ui is willing to pay for x items.
Zhang, Y, Chin, FYL, Ting, HF
openaire +4 more sources
Online Learning Algorithms [PDF]
Foundations of Computational Mathematics, 2005 In this paper, we study an online learning algorithm in Reproducing Kernel Hilbert Spaces (RKHSs) and general Hilbert spaces. We present a general form of the stochastic gradient method to minimize a quadratic potential function by an independent identically distributed (i.i.d.) sample sequence, and show a probabilistic upper bound for its convergence.
Smale, Steve, Yao, Yuan
openaire +2 more sources
Online Course on the History of Algorithms [PDF]
IEEE Revista Iberoamericana de Tecnologias del Aprendizaje, 2013 This paper describes the objectives, content, learning methodology and results of an online course on the History of Algorithms for engineering students at Polytechnic University of Madrid (UPM). This course is conducted in a virtual environment based on Moodle, with a student-centred educational model which includes a detailed planning of learning ...
García López, Alfonsa +2 more
openaire +2 more sources
International Journal of Neural Systems, 2008 We introduce a set of clustering algorithms whose performance function is such that the algorithms overcome one of the weaknesses of K-means, its sensitivity to initial conditions which leads it to converge to a local optimum rather than the global optimum.
Barbakh, Wesam, Fyfe, Colin
openaire +3 more sources
IEEE Access, 2017 Increased energy consumption becomes a major issue in 5G cellular networks, which inspires the network operators to deploy renewable energy sources. However, due to the fluctuating nature of renewable energy sources, the energy harvested by base stations
Bingyu Xu +4 more
doaj +1 more source
Online Correlation Clustering [PDF]
, 2010 We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes.
Mathieu, Claire +2 more
core +4 more sources
Online Regularized Classification Algorithms [PDF]
IEEE Transactions on Information Theory, 2006 Summary: This paper considers online classification learning algorithms based on regularization schemes in reproducing kernel Hilbert spaces associated with general convex loss functions. A novel capacity independent approach is presented. It verifies the strong convergence of the algorithm under a very weak assumption of the step sizes and yields ...
Yiming Ying, Ding-Xuan Zhou
openaire +1 more source
Online Gradient Descent for Kernel-Based Maximum Correntropy Criterion
Entropy, 2019 In the framework of statistical learning, we study the online gradient descent algorithm generated by the correntropy-induced losses in Reproducing kernel Hilbert spaces (RKHS).
Baobin Wang, Ting Hu
doaj +1 more source
Online Robust Subspace Clustering With Application to Power Grid Monitoring
IEEE Access, 2023 In this work, a robust subspace clustering algorithm is developed to exploit the inherent union-of-subspaces structure in the data for reconstructing missing measurements and detecting anomalies.
Young-Hwan Lee +3 more
doaj +1 more source