17760 search results - page 195 / 3552 » A Generalization of the Massey-Ding Algorithm |
129
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
181
click to vote
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
122
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
134
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
108
click to vote
NIPS
1998
15 years 5 months ago
1998
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...