7623 search results - page 316 / 1525 » Algorithmic Features of Eclat |
145
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
This paper introduces a new collective learning genetic algorithm (CLGA) which employs individual learning to do intelligent recombination based on a cooperative exchange of knowl...
162
click to vote
NIPS
2008
15 years 8 months ago
2008
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
150
click to vote
EACL
2006
ACL Anthology
15 years 8 months ago
2006
ACL Anthology
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
175
click to vote
IJCAI
2001
15 years 8 months ago
2001
Constraint propagation is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the us...
186
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
— Ergodic stochastic optimization (ESO) algorithms are proposed to solve resource allocation problems that involve a random state and where optimality criteria are expressed in t...