206 search results - page 15 / 42 » Random backtracking in backtrack search algorithms for satis... |
117
click to vote
ISCIS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
112
click to vote
WEA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
153
click to vote
IJCAI
2003
15 years 5 months ago
2003
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
141
Voted
ESA
1997
Springer
15 years 8 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
109
Voted
AUSAI
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...