Results 11 to 20 of about 10,339,739 (265)
Competitive Analysis of Algorithms for an Online Distribution Problem
AlgorithmsWe study an online distribution problem in which a producer has to send a load from an origin to a destination. At each time period before the deadline, they ask for transportation price quotes and have to decide to either accept or not accept the ...
Alessandro Barba +2 more
doaj +2 more sources
Online Algorithms with Randomly Infused Advice [PDF]
, 2023 We introduce a novel method for the rigorous quantitative evaluation of online algorithms that relaxes the "radical worst-case" perspective of classic competitive analysis.
Emek, Yuval +3 more
core +1 more source
Online Primal-Dual Algorithms with Configuration Linear Programs [PDF]
, 2020 In this paper, we present primal-dual algorithms for online problems with non-convex objectives. Problems with convex objectives have been extensively studied in recent years where the analyses rely crucially on the convexity and the Fenchel duality ...
Thắng, Nguyễn Kim
core +1 more source
09171 Abstracts Collection – Adaptive, Output Sensitive, Online and Parameterized Algorithms [PDF]
, 2009 From 19.01. to 24.04.2009, the Dagstuhl Seminar 09171 ``Adaptive, Output Sensitive, Online and Parameterized Algorithms '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current
López-Ortiz, Alejandro +3 more
core +1 more source
Brief Announcement: Temporal Locality in Online Algorithms [PDF]
, 2022 Online algorithms make decisions based on past inputs, with the goal of being competitive against an algorithm that sees also future inputs. In this work, we introduce time-local online algorithms; these are online algorithms in which the output at any ...
Parham, Mahmoud +6 more
core +1 more source
On the use of biased-randomized algorithms for solving non-smooth optimization problems
, 2020 Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory ...
Juan A.A. +4 more
core +1 more source
Online learning over graphs [PDF]
, 2005 We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simple algorithms and performance guarantees that we naturally interpret in ...
Mark Herbster +5 more
core +1 more source
New bounds for online packing LPs [PDF]
, 2014 Solving linear programs online has been an active area of research in recent years and was used with great success to develop new online algorithms for a variety of problems. We study the setting introduced by Ochel et al.
Matthias Englert +5 more
core +1 more source
Sequential Change-Point Detection via Online Convex Optimization
Entropy, 2018 Sequential change-point detection when the distribution parameters are unknown is a fundamental problem in statistics and machine learning. When the post-change parameters are unknown, we consider a set of detection procedures based on sequential ...
Yang Cao, Liyan Xie, Yao Xie, Huan Xu
doaj +1 more source
A Review and Characterization of Progressive Visual Analytics
Informatics, 2018 Progressive Visual Analytics (PVA) has gained increasing attention over the past years. It brings the user into the loop during otherwise long-running and non-transparent computations by producing intermediate partial results.
Marco Angelini +3 more
doaj +1 more source