3415 search results - page 589 / 683 » Lower Bounds for Kernelizations |
MST
1998
13 years 9 months ago
1998
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcherâ...
PAMI
2002
13 years 9 months ago
2002
In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four ...
SIAMCOMP
2002
13 years 9 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
TON
1998
13 years 9 months ago
1998
Abstract—The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes signiï¬cantly to its cost, especially in long...
TPDS
1998
13 years 9 months ago
1998
—We show that deadlocks due to dependencies on consumption channels are a fundamental problem in wormhole multicast routing. This type of resource deadlocks has not been addresse...