Results 41 to 50 of about 6,450,253 (299)
Special Issue on Graph Algorithms
Algorithms, 2013 This special issue of Algorithms is devoted to the design and analysis of algorithms for solving combinatorial problems of a theoretical or practical nature involving graphs, with a focus on computational complexity.
Jesper Jansson
doaj +1 more source
All-norm approximation algorithms [PDF]
Journal of Algorithms, 2002 Summary: A major drawback in optimization problems and in particular in scheduling problems is that for every measure there may be a different optimal solution. In many cases the various measures are different \(\ell_p\) norms. We address this problem by introducing the concept of an all-norm \(\rho\)-approximation algorithm, which supplies one ...
Yossi Azar +3 more
openaire +5 more sources
Decomposition of the Knapsack Problem for Increasing the Capacity of Operating Rooms
Mathematics, 2022 This paper is aimed at the problem of scheduling surgeries in operating rooms. To solve this problem, we suggest using some variation of the bin packing problem. The model is based on the actual operation of 10 operating rooms, each of which belongs to a
Alexander Alekseevich Lazarev +2 more
doaj +1 more source
Efficient Subspace Approximation Algorithms [PDF]
Discrete & Computational Geometry, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nariankadu D. Shyamalkumar +1 more
openaire +2 more sources
Provably Efficient Reinforcement Learning with Linear Function Approximation [PDF]
Annual Conference Computational Learning Theory, 2019 Modern reinforcement learning (RL) is commonly applied to practical problems with an enormous number of states, where function approximation must be deployed to approximate either the value function or the policy.
Chi Jin +3 more
semanticscholar +1 more source
Counting With Tinytable: Every Bit Counts!
IEEE Access, 2019 Bloom filters are space efficient data structures that support approximate membership queries. They are easily extensible but incur significant overheads when extended to support additional functionality, such as removals or counting.
Gil Einziger, Roy Friedman
doaj +1 more source
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions [PDF]
SIAM Review, 2009 Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data analysis and scientific computing.
N. Halko, P. Martinsson, J. Tropp
semanticscholar +1 more source
Bamboo Garden Trimming Problem: Priority Schedulings
Algorithms, 2019 The paper deals with the Bamboo Garden Trimming (BGT) problem introduced in [Gąsieniec et al., SOFSEM’17]. The problem is difficult to solved due to its close relationship to Pinwheel scheduling. The garden with n bamboos is an analogue of a system
Mattia D’Emidio +2 more
doaj +1 more source
Approximation Algorithms for Anchored Multiwatchman Routes
Computing in Geometry and TopologyWe study some variants of the k-Watchman Routes problem, the cooperative version of the classic Watchman Route problem in a simple polygon. The k watchmen may be required to see the whole polygon, or some pre-determined quota of area within the polygon,
Joseph S.B. Mitchell, Linh Nguyen
doaj +1 more source
The AAA Algorithm for Rational Approximation [PDF]
SIAM Journal on Scientific Computing, 2018 We introduce a new algorithm for approximation by rational functions on a real or complex set of points, implementable in 40 lines of Matlab and requiring no user input parameters. Even on a disk or interval the algorithm may outperform existing methods, and on more complicated domains it is especially competitive. The core ideas are (1) representation
Yuji Nakatsukasa +2 more
openaire +4 more sources