874 search results - page 28 / 175 » Faster Algorithms for Semi-Matching Problems |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We show that the natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoret...
CEC
2009
IEEE
14 years 9 days ago
2009
IEEE
Abstract—A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization pr...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...