4565 search results - page 443 / 913 » Time Optimal Self-Stabilizing Algorithms |
113
click to vote
COR
2008
15 years 4 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
142
click to vote
IANDC
2008
15 years 4 months ago
2008
We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In t...
178
Voted
ANTSW
2010
Springer
15 years 2 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
135
click to vote
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
187
Voted
SIGMETRICS
2012
ACM
13 years 7 months ago
2012
ACM
In a public cloud, bandwidth is traditionally priced in a pay-asyou-go model. Reflecting the recent trend of augmenting cloud computing with bandwidth guarantees, we consider a n...