613 search results - page 99 / 123 » Generalized Traveling Salesman Problem Reduction Algorithms |
121
click to vote
SIGIR
2004
ACM
15 years 8 months ago
2004
ACM
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
128
click to vote
SC
2003
ACM
15 years 8 months ago
2003
ACM
This paper presents an algorithm for implementing optimal hardware-based multicast trees, on networks that provide hardware support for collective communication. Although the prop...
164
click to vote
PPOPP
2009
ACM
16 years 3 months ago
2009
ACM
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
166
click to vote
NETWORKS
2011
14 years 6 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
109
click to vote
DAC
2006
ACM
16 years 4 months ago
2006
ACM
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...