5473 search results - page 98 / 1095 » On the graph isomorphism problem |
143
click to vote
AIPS
2010
15 years 8 months ago
2010
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approa...
160
click to vote
4OR
2004
15 years 6 months ago
2004
This is a summary of the most important results presented in the author's PhD thesis (Spanjaard, 2003). This thesis, written in French, was defended on 16 December 2003 and su...
165
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
132
click to vote
COLING
1994
15 years 7 months ago
1994
The revised graph unification algorithms presented here are more efficient because they reduce the amount of copying that was necessary because of the assumption that data-structu...
166
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...