4565 search results - page 231 / 913 » Time Optimal Self-Stabilizing Algorithms |
96
Voted
NETWORKS
2008
15 years 18 days ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
167
Voted
PODS
2009
ACM
16 years 1 months ago
2009
ACM
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
108
Voted
IPCO
2010
15 years 2 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
125
click to vote
SOFSEM
2000
Springer
15 years 4 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
101
click to vote
ACMSE
2008
ACM
15 years 2 months ago
2008
ACM
With stock surpluses and shortages representing one of the greatest elements of risk to wholesalers, a solution to the multiretailer supply chain management problem would result i...