Sciweavers

3136 search results - page 236 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
TCS
2008
15 years 6 months ago
Comparing evolutionary algorithms to the (1+1)-EA
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
Pavel A. Borisovsky, Anton V. Eremeev
ICS
1989
Tsinghua U.
15 years 10 months ago
Convergence rate and termination of asynchronous iterative algorithms
We consider iterative algorithms of the form z := f(z), executed by a parallel or distributed computing system. We focus on asynchronous implementations whereby each processor ite...
Dimitri P. Bertsekas, John N. Tsitsiklis
ECML
2006
Springer
15 years 10 months ago
EM Algorithm for Symmetric Causal Independence Models
Causal independence modelling is a well-known method both for reducing the size of probability tables and for explaining the underlying mechanisms in Bayesian networks. In this pap...
Rasa Jurgelenaite, Tom Heskes
BIBE
2009
IEEE
131views Bioinformatics» more  BIBE 2009»
15 years 9 months ago
Learning Scaling Coefficient in Possibilistic Latent Variable Algorithm from Complex Diagnosis Data
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
Zong-Xian Yin
MP
2006
73views more  MP 2006»
15 years 6 months ago
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
We present a primal-dual interior-point algorithm with a filter line-search method for nonlinear programming. Local and global convergence properties of this method were analyzed i...
Andreas Wächter, Lorenz T. Biegler