Results 31 to 40 of about 151,397 (266)
The Online Reservation Problem
Many sharing-economy platforms operate as follows. Owners list the availability of resources, prices, and contract-length limits. Customers propose contract start times and lengths. The owners decide immediately whether to accept or decline each proposal,
Shashank Goyal, Diwakar Gupta
doaj +1 more source
The Divergence of Reinforcement Learning Algorithms with Value-Iteration and Function Approximation [PDF]
This paper gives specific divergence examples of value-iteration for several major Reinforcement Learning and Adaptive Dynamic Programming algorithms, when using a function approximator for the value function.
Alonso, Eduardo, Fairbank, Michael
core +2 more sources
Fast greedy triangulation algorithms [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dickerson, Matthew T. +3 more
openaire +2 more sources
Distributed greedy pursuit algorithms [PDF]
For compressed sensing over arbitrarily connected networks, we consider the problem of estimating underlying sparse signals in a distributed manner. We introduce a new signal model that helps to describe inter-signal correlation among connected nodes.
Dennis Sundman +2 more
openaire +2 more sources
Lebesgue constants for Chebyshev thresholding greedy algorithms
We investigate the efficiency of Chebyshev Thresholding Greedy Algorithm (CTGA) for an n-term approximation with respect to general bases in a Banach space. We show that the convergence property of CTGA is better than TGA for non-quasi-greedy bases. Then
Chunfang Shao, Peixin Ye
doaj +1 more source
On the Automated and Reactive Optimization of Highly-Dynamic Communication Network Infrastructures [PDF]
In this paper, the applicability of heuristic methods for an automated and reactive optimization of network infrastructures in highly-dynamic communication networks is studied.
Robin Mueller-Bady +3 more
doaj +3 more sources
Image reconstruction algorithm based on variable atomic number matching pursuit
As the most critical part of compressive sensing theory, reconstruction algorithm has an impact on the quality and speed of image reconstruction. After studying some existing convex optimization algorithms and greedy algorithms, we find that convex ...
Hongtu Zhao, Chong Chen, Chenxu Shi
doaj +1 more source
Greedy Algorithms for Steiner Forest
In the Steiner Forest problem, we are given terminal pairs $\{s_i, t_i\}$, and need to find the cheapest subgraph which connects each of the terminal pairs together.
Garg N. +3 more
core +1 more source
Tiled QR factorization algorithms [PDF]
This work revisits existing algorithms for the QR factorization of rectangular matrices composed of p-by-q tiles, where p >= q. Within this framework, we study the critical paths and performance of algorithms such as Sameh and Kuck, Modi and Clarke ...
Bouwmeester, Henricus +3 more
core +5 more sources
Greedy Algorithms make Efficient Mechanisms
We study mechanisms that use greedy allocation rules and pay-your-bid pricing to allocate resources subject to a matroid constraint. We show that all such mechanisms obtain a constant fraction of the optimal welfare at any equilibrium of bidder behavior,
Lucier, Brendan, Syrgkanis, Vasilis
core +1 more source

