7 search results - page 1 / 2 » A SAT Based Effective Algorithm for the Directed Hamiltonian... |
CSR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been ...
JAIR
2010
12 years 11 months ago
2010
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, i...
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...
ICDCS
2000
IEEE
13 years 9 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
AAAI
2007
13 years 7 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...