Results 11 to 20 of about 1,247,707 (283)
Social Media + Society, 2022 How do online daters come to understand and make sense of their online dating experiences and the algorithms that underlie online dating platforms? Across two mixed-method studies, we take a metaphoric approach to identify and explore people’s folk ...
Sabrina Angela Huang +2 more
doaj +2 more sources
An Efficient Online Cache Replacement Algorithm for 5G Networks
IEEE Access, 2018 In recent years, 5G cellular networks utilization has rapidly increased and is expected to grow even more in the near future. This will put the current cellular networks operators in a challenge to overcome the network's limits to satisfy the increasing ...
Ammar Gharaibeh +2 more
doaj +1 more source
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
Online Uniformly Inserting Points on the Sphere
Algorithms, 2018 Uniformly inserting points on the sphere has been found useful in many scientific and engineering fields. Different from the offline version where the number of points is known in advance, we consider the online version of this problem.
Rong Zhou +5 more
doaj +1 more source
, 2018 This paper is devoted to the online dominating set problem and its variants. We believe the paper represents the first systematic study of the effect of two limitations of online algorithms: making irrevocable decisions while not knowing the future, and ...
A Borodin +24 more
core +2 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
On the List Update Problem with Advice [PDF]
, 2016 We study the online list update problem under the advice model of computation. Under this model, an online algorithm receives partial information about the unknown parts of the input in the form of some bits of advice generated by a benevolent offline ...
Boyar, Joan +3 more
core +3 more sources
Quantum online algorithms for a model of the request-answer game with a buffer
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 In this paper, we considered online algorithms as a request-answer game between two players: an adversary that generates input requests and an online algorithm that answers them.
K.R. Khadiev, D.I. Lin
doaj +1 more source
Relaxing the Irrevocability Requirement for Online Graph Algorithms [PDF]
, 2017 Online graph problems are considered in models where the irrevocability requirement is relaxed. Motivated by practical examples where, for example, there is a cost associated with building a facility and no extra cost associated with doing it later, we ...
A Gu +15 more
core +3 more sources
Better algorithms for unfair metrical task systems and applications [PDF]
, 2003 Unfair metrical task systems are a generalization of online metrical task systems. In this paper we introduce new techniques to combine algorithms for unfair metrical task systems and apply these techniques to obtain improved randomized online algorithms
Fiat, Amos, Mendel, Manor
core +1 more source