4565 search results - page 586 / 913 » Time Optimal Self-Stabilizing Algorithms |
109
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper we present findings from our windowing BitTorrent simulations and show that by carefully optimizing other factors a reasonable level of performance can be achieved...
143
Voted
ESA
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
104
click to vote
ALGORITHMICA
2008
15 years 3 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
117
Voted
DAM
2007
15 years 3 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
120
click to vote
NECO
2008
15 years 3 months ago
2008
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...