Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 31 - 40
of
513
Distributed online modified greedy algorithm for networked storage operation under uncertainty
- Online]. Available: http://arxiv.org/pdf/1406.4615v2.pdf
, 2014
"... iv ..."
On the Performance of Greedy Algorithms inPacket Buffering
"... Abstract We study a basic buffer management problem that arises in network switches. Consider m inputports, each of which is equipped with a buffer (queue) of limited capacity. Data packets arrive online ..."
Abstract
- Add to MetaCart
Abstract We study a basic buffer management problem that arises in network switches. Consider m inputports, each of which is equipped with a buffer (queue) of limited capacity. Data packets arrive online
Upper Bounds for Maximally Greedy Binary Search Trees
, 2011
"... At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Derryberry et al. As part of their results, Demaine et al. considered GreedyFuture, an offline BST algorithm that greedil ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
that greedily rearranges the search path to minimize the cost of future searches. They showed that GreedyFuture is actually an online algorithm in their geometric view, and that there is a way to turn GreedyFuture into an online BST algorithm with only a constant factor increase in total search cost. Demaine et
Truthful Mechanisms via Greedy Iterative Packing
, 2009
"... An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is whether an α-approximation algorithm translates into an α-approximate truthful mechanism. It is well-known that plugging ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
of approximation algorithms, which we call loser-independence. Intuitively, a loser-independent algorithm does not change its outcome when the bid of a losing agent increases, unless that agent becomes a winner. We demonstrate that loser-independent algorithms can be employed as sub-procedures in a greedy
Greedy Edge-Disjoint Paths in Complete Graphs
, 2003
"... The maximum edge-disjoint paths problem (MEDP) is one of the most classical NP-hard problems. We study the approximation ratio of a simple and practical approximation algorithm, the shortest-path-first greedy algorithm (SGA), for MEDP in complete graphs. Previously, it was known that this ratio is a ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
of instances that shows that SGA cannot be better than a 3-approximation algorithm. Our upper and lower bounds hold also for the bounded-length greedy algorithm, a simple on-line algorithm for MEDP.
A Greedy Framework for First-Order Optimization
"... Introduction. Recent work has shown many connections between conditional gradient and other first-order optimization methods, such as herding [3] and subgradient descent [2]. By considering a type of proximal conditional method, which we call boosted mirror descent (BMD), we are able to unify all of ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
of these algorithms into a single framework, which can be interpreted as taking successive arg-mins of a sequence of surrogate functions. Using a standard online learning analysis based on
A greedy approach for the distributed Karhune-Loeve transform
- in Proc. IEEE Int. Conf. Acoust., Speech, Signal Process. (ICASSP 2010
, 2010
"... In the distributed linear source coding problem a set of distributed sensors observe subsets of a data vector, and provide the fusion center with linearly encoded data. The goal is to determine the encoding matrix of each sensor such that the fusion center reconstructs the entire data vector with mi ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
propose a greedy-based non-iterative algorithm. In each step, one of the encoding matrices is updated by appending an additional row. The algorithm selects in a greedy fashion one sensor that provides the largest improvement in MSE, and terminates when all the encoding matrices reach their prede
Greedy Algorithm for Hub Selection in Interactive Network Applications
"... Many multiple users interaction in network applications such as teleconferencing, network gaming and online trading are gaining popularity but these applications require that the delay difference in between multiple clients of the Service. In This Project We proposes a Technique name as Latency Equa ..."
Abstract
- Add to MetaCart
Many multiple users interaction in network applications such as teleconferencing, network gaming and online trading are gaining popularity but these applications require that the delay difference in between multiple clients of the Service. In This Project We proposes a Technique name as Latency
Popularity-Aware GreedyDual-Size Web Proxy Caching Algorithms
- IN PROCEEDINGS OF ICDCS
, 1999
"... Web caching aims to reduce network trac, server load, and user-perceived retrieval delays by replicating "popular" content on proxy caches that are strategically placed within the network. While key to eective cache utilization, popularity information (e.g. relative access frequencies o ..."
Abstract
-
Cited by 29 (1 self)
- Add to MetaCart
of objects requested through a proxy) is seldom incorporated directly in cache replacement algorithms. Rather, other properties of the request stream (e.g. temporal locality and content size), which are easier to capture in an on-line fashion, are used to indirectly infer popularity information
Results 31 - 40
of
513
