1232 search results - page 58 / 247 » Digraphs: theory, algorithms and applications |
169
click to vote
GECCO
2007
Springer
16 years 8 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
170
click to vote
EMMCVPR
2001
Springer
15 years 10 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
158
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
139
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
We discuss a theory for a realistic, applicable scaled genetic algorithm (GA) which converges asymptoticly to global optima in a coevolutionary setting involving two species. It is...
167
click to vote
WWW
2008
ACM
16 years 6 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....