3136 search results - page 259 / 628 » Comparison of Clique-Listing Algorithms |
156
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....
190
click to vote
ADHOC
2008
15 years 6 months ago
2008
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
157
click to vote
TASLP
2008
15 years 6 months ago
2008
This paper presents a novel online relevant set algorithm for a linearly-scored block sequence translation model. The key component is a new procedure to directly optimize the glob...
198
click to vote
EUROPAR
1997
Springer
15 years 10 months ago
1997
Springer
We experiment with sequential and parallel versions of the Karatsuba multiplication algorithm implemented under the paclib computer algebra system on a Sequent Symmetry shared-memo...
187
click to vote
PDIS
1994
IEEE
15 years 10 months ago
1994
IEEE
Many parallel join algorithms have been proposed so far but most of which are developed focused on minimizing the disk It0 and CPU costs. The communication cost, however, is also ...