Sciweavers

2111 search results - page 45 / 423
» Understanding the Yarowsky Algorithm
Sort
View
CEC
2007
IEEE
14 years 5 months ago
Greedy transformation of evolutionary algorithm search spaces for scheduling problems
— Many scheduling algorithms search the space of possible solutions (schedules), but some instead search the space of permutations of the set of jobs, employing a greedy algorith...
David Joslin, Justin Collins
NIPS
1998
14 years 3 days ago
Convergence of the Wake-Sleep Algorithm
The W-S (Wake-Sleep) algorithm is a simple learning rule for the models with hidden variables. It is shown that this algorithm can be applied to a factor analysis model which is a...
Shiro Ikeda, Shun-ichi Amari, Hiroyuki Nakahara
ECCC
2006
97views more  ECCC 2006»
13 years 10 months ago
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
Frank Neumann, Carsten Witt
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 10 months ago
Mathematical analysis of the recoil growth algorithm to generate multi-polymer systems
The Recoil Growth algorithm, proposed in 1999 by Consta et al., is one of the most efficient algorithm available in the literature to sample from a multi-polymer system. While the ...
F. Simatos
IWOCA
2009
Springer
152views Algorithms» more  IWOCA 2009»
14 years 5 months ago
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
Robert Ganian, Petr Hlinený