Sciweavers

AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
13 years 8 months ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
M. Sohel Rahman, Costas S. Iliopoulos
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
13 years 8 months ago
Efficiency of Data Distribution in BitTorrent-Like Systems
BitTorrent (BT) in practice is a very efficient method to share data over a network of clients. In this paper we extend the recent work of Arthur and Panigrahy [1] on modelling the...
Ho-Leung Chan, Tak Wah Lam, Prudence W. H. Wong
AAIM
2007
Springer
119views Algorithms» more  AAIM 2007»
13 years 8 months ago
An Efficient, and Fast Convergent Algorithm for Barrier Options
Tian-Shyr Dai, Yuh-Dauh Lyuu
AAIM
2007
Springer
120views Algorithms» more  AAIM 2007»
13 years 8 months ago
Online OVSF Code Assignment with Resource Augmentation
Abstract. Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband Code-Division MultipleAccess (W-CDMA) systems, which play an important ro...
Francis Y. L. Chin, Yong Zhang, Hong Zhu
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
13 years 8 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu
AAIM
2007
Springer
142views Algorithms» more  AAIM 2007»
13 years 8 months ago
Design of a Fuzzy PI Controller to Guarantee Proportional Delay Differentiation on Web Servers
PI controller has attracted researchers in industrial control processes because of its simplicity and robust performance in a wide range of operating conditions. It has been used t...
Ka Ho Chan, Xiaowen Chu
AAIM
2007
Springer
118views Algorithms» more  AAIM 2007»
13 years 8 months ago
Significance-Driven Graph Clustering
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale b...
Marco Gaertler, Robert Görke, Dorothea Wagner
AAIM
2007
Springer
188views Algorithms» more  AAIM 2007»
13 years 10 months ago
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirot...
AAIM
2007
Springer
101views Algorithms» more  AAIM 2007»
13 years 10 months ago
How to Play the Majority Game with Liars
Steve Butler, Jia Mao, Ronald L. Graham
AAIM
2007
Springer
126views Algorithms» more  AAIM 2007»
13 years 10 months ago
Mixed Criteria Packet Scheduling
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
Chad R. Meiners, Eric Torng