Results 31 to 40 of about 315,460 (265)
Randomized Competitive Analysis for Two Server Problems
Algorithms, 2008 We prove that there exists a randomized online algorithm for the 2-server 3-point problem whose expected competitive ratio is at most 1.5897. This is the first nontrivial upper bound for randomized k-server algorithms in a general metric space whose ...
Jun Kawahara, Kazuo Iwama, Wolfgang Bein
doaj +1 more source
Online Algorithms with Multiple Predictions
CoRR, 2022 This paper studies online algorithms augmented with multiple machine-learned predictions. While online algorithms augmented with a single prediction have been extensively studied in recent years, the literature for the multiple predictions setting is sparse.
Keerti Anand +3 more
openaire +3 more sources
EURO Journal on Computational Optimization, 2015 In a k-min search problem, a player wants to buy k units of an asset with the objective of minimizing the total buying cost. At each time period t, a price qt is observed, and the player has to decide on the number of units to buy without any knowledge ...
Javeria Iqbal, Iftikhar Ahmad
doaj +1 more source
Online Graph Algorithms with Predictions [PDF]
, 2022 Online algorithms with predictions is a popular and elegant framework for bypassing pessimistic lower bounds in competitive analysis. In this model, online algorithms are supplied with future predictions, and the goal is for the competitive ratio to smoothly interpolate between the best offline and online bounds as a function of the prediction error ...
Yossi Azar +2 more
openaire +2 more sources
The Scary Black Box: AI Driven Recommender Algorithms as The Most Powerful Social Force
Etnoantropološki Problemi, 2022 Recommender algorithms shape societies by individually exposing online users to everything they see, hear and feel in real time. We examine the development of recommender algorithms from the Page Rank and advertising platforms to social media trending ...
Ljubiša Bojić +2 more
doaj +1 more source
An online algorithm for constrained POMDPs [PDF]
2010 IEEE International Conference on Robotics and Automation, 2010 This work seeks to address the problem of planning in the presence of uncertainty and constraints. Such problems arise in many situations, including the basis of this work, which involves planning for a team of first responders (both humans and robots) operating in an urban environment.
Aditya Undurti, Jonathan P. How
openaire +3 more sources
Online Learning Approaches in Maximizing Weighted Throughput in an Unreliable Channel
Tsinghua Science and Technology, 2012 We design online algorithms to schedule unit-length packets with values and deadlines through an unreliable communication channel. In this model, time is discrete. Packets arrive over time; each packet has a non-negative value and an integer deadline. In
Zhi Zhang, Fei Li
doaj +1 more source
Peripheral lysosomes recruit PLEKHG3 to focal adhesions and restrain protrusion dynamics
FEBS Letters, EarlyView.Proximity‐dependent labeling at the LAMTOR complex revealed the Rho GEF PLEKHG3 as a lysosome‐proximal protein directing the study toward the influence of lysosome positioning on actin dynamics and cell motility. We show that PLEKHG3 colocalizes with lysosomes at focal adhesion sites and observe that forced peripheral dispersion of lysosomes hinders ...
Rainer Ettelt +8 more
wiley +1 more source
Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time
AlgorithmsConsider a collection of entities moving continuously with bounded speed, but otherwise unpredictably, in some low-dimensional space. Two such entities encroach upon one another at a fixed time if their separation is less than some specified threshold ...
William Evans, David Kirkpatrick
doaj +1 more source
Converting Online Algorithms to Local Computation Algorithms [PDF]
, 2012 We propose a general method for converting online algorithms to local computation algorithms by selecting a random permutation of the input, and simulating running the online algorithm. We bound the number of steps of the algorithm using a query tree, which models the dependencies between queries.
Yishay Mansour +3 more
openaire +2 more sources