7930 search results - page 268 / 1586 » Greedy in Approximation Algorithms |
175
click to vote
WOSP
2005
ACM
16 years 4 days ago
2005
ACM
Designers of distributed systems often rely on replicas for increased robustness, scalability, and performance. Replicated server architectures require some technique to select a ...
160
click to vote
ALENEX
2001
15 years 8 months ago
2001
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
171
click to vote
RSFDGRC
2005
Springer
16 years 2 days ago
2005
Springer
In this paper, the concept of a granulation order is proposed in an information system. The positive approximation of a set under a granulation order is defined. Some properties o...
207
click to vote
ICDCIT
2007
Springer
16 years 22 days ago
2007
Springer
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
181
click to vote
JPDC
2008
15 years 6 months ago
2008
In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe schemes for parallel coarsening, parallel greedy k-way...