We study the performance of a simple greedy on-line algorithm for routing large file transfers in a network. The goal of the algorithm is to minimize network congestion. We show that the competitive ratio of the greedy algorithm is O (

We study the online transportation problem. We show that the halfopt-competitive ratio for the greedy algorithm is (min(m; logC)), where m is the number of server sites, and C is the total number of servers. We also present an algorithm Balance that is a modi cation of the greedy algorithm and that has a halfopt-competitive ratio of O(1).

When a set of coregulated genes share a common structural RNA motif, e.g. a hairpin, most motif search approaches fail to locate the covarying but structurally conserved motif. There do exist methods that can locate structural RNA motifs, like FOLDALIGN, but the main problem with these methods is that they are computationally expensive. In FOLDALIGN, a major contribution to this is the use of a...

Packet classification is used to determine the behavior of incoming packets in network devices according defined rules. As it achieved using a linear search on rule list, large number rules will lead longer communication latency. To solve this, problem finding order minimizing latency has been studied. Misherghi et al. and Harada have proposed that relaxes policy-based constraints. In this pape...