Sciweavers

260 search results - page 15 / 52
» Efficient Computation of Optimal Trading Strategies
Sort
View
RECOMB
1997
Springer
13 years 11 months ago
A more efficient approximation scheme for tree alignment
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
Lusheng Wang, Tao Jiang, Dan Gusfield
GCC
2003
Springer
14 years 26 days ago
Dynamic Data Grid Replication Strategy Based on Internet Hierarchy
Abstract. In data grid, large quantity of data files is produced and data replication is applied to reduce data access time. Efficiently utilizing grid resources becomes important ...
Sang-Min Park, Jai-Hoon Kim, Young-Bae Ko, Won-Sik...
ICPPW
2003
IEEE
14 years 28 days ago
A Fault-tolerant Routing Strategy for Gaussian Cube Using Gaussian Tree
Gaussian Cubes (GCs) are a family of interconnection topologies in which the interconnection density and algorithmic efficiency are linked by a common parameter, the variation of ...
Loh Peter, Xinhua Zhang
IPPS
2007
IEEE
14 years 1 months ago
Replication Strategy in Unstructured Peer-to-Peer Systems
1 The unstructured Peer-to-Peer (P2P) systems usually use a “blind search” method to find the requested data object by propagating a query to a number of peers randomly. In or...
Guofu Feng, Yuquan Jiang, Guihai Chen, Qing Gu, Sa...
GCC
2007
Springer
14 years 1 months ago
Dynamic Data Replication based on Local Optimization Principle in Data Grid
Efficient data access is one way of improving the performance of the Data Grid. In order to speed up the data access and reduce bandwidth consumption, Data Grid replicates essenti...
Yulai Yuan, Yongwei Wu, Guangwen Yang, Feng Yu