Sciweavers

2745 search results - page 135 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
APDC
1997
15 years 5 months ago
A Parallel Algorithm for Optimal Task Assignment in Distributed Systems
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...
Ishfaq Ahmad, Muhammad Kafil
ADC
2008
Springer
139views Database» more  ADC 2008»
15 years 10 months ago
Computing Structural Similarity of Source XML Schemas against Domain XML Schema
In this paper, we study the problem of measuring structural similarities of large number of source schemas against a single domain schema, which is useful for enhancing the qualit...
Jianxin Li, Chengfei Liu, Jeffrey Xu Yu, Jixue Liu...
ISCI
2008
159views more  ISCI 2008»
15 years 3 months ago
Large scale evolutionary optimization using cooperative coevolution
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...
Zhenyu Yang, Ke Tang, Xin Yao
CORR
2012
Springer
210views Education» more  CORR 2012»
13 years 11 months ago
Fast MCMC sampling for Markov jump processes and continuous time Bayesian networks
Markov jump processes and continuous time Bayesian networks are important classes of continuous time dynamical systems. In this paper, we tackle the problem of inferring unobserve...
Vinayak Rao, Yee Whye Teh
INFOVIS
2005
IEEE
15 years 9 months ago
Importance-Driven Visualization Layouts for Large Time Series Data
Time series are an important type of data with applications in virtually every aspect of the real world. Often a large number of time series have to be monitored and analyzed in p...
Ming C. Hao, Umeshwar Dayal, Daniel A. Keim, Tobia...