Results 31 to 40 of about 742,132 (325)
Jointly Optimal Routing and Caching for Arbitrary Network Topologies
, 2017 We study a problem of fundamental importance to ICNs, namely, minimizing routing costs by jointly optimizing caching and routing decisions over an arbitrary network topology. We consider both source routing and hop-by-hop routing settings. The respective
Ioannidis, Stratis, Yeh, Edmund
core +1 more source
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
Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems
Algorithms, 2022 Motivated by applications in ride-sharing and truck-delivery, we study the problem of matching a number of requests and assigning them to cars. A number of cars are given, each of which consists of a location and a speed, and a number of requests are ...
Kelin Luo, Frits C. R. Spieksma
doaj +1 more source
Approximation algorithms for wavelet transform coding of data streams [PDF]
, 2006 This paper addresses the problem of finding a B-term wavelet representation of a given discrete function $f \in \real^n$ whose distance from f is minimized.
Guha, Sudipto, Harb, Boulos
core +8 more sources
Rounding in ¿-approximation algorithms
2006 Symposium on Communications and Vehicular Technology, 2006 A common approach to deal with NP-hard problems is to deploy polynomial-time ϵ-approximation algorithms. These algorithms often resort to rounding and scaling to guarantee a solution that is within a factor (1 + isin) of the optimal solution. Usually, researchers either only round up or only down.
openaire +4 more sources
Approximate Weak Greedy Algorithms [PDF]
Advances in Computational Mathematics, 2001 We present a generalization of V. Temlyakov's weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries.
Gribonval, Rémi, Nielsen, Morten
openaire +3 more sources
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
Multi-level stochastic approximation algorithms [PDF]
, 2014 This paper studies multi-level stochastic approximation algorithms. Our aim is to extend the scope of the multilevel Monte Carlo method recently introduced by Giles (Giles 2008) to the framework of stochastic optimization by means of stochastic ...
Frikha, Noufel
core +1 more source
Scheduling MapReduce Jobs under Multi-Round Precedences
, 2016 We consider non-preemptive scheduling of MapReduce jobs with multiple tasks in the practical scenario where each job requires several map-reduce rounds.
AM Hariri +11 more
core +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source