206 search results - page 31 / 42 » Random backtracking in backtrack search algorithms for satis... |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...
AI
2006
Springer
13 years 8 months ago
2006
Springer
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
INFORMATICALT
2006
13 years 8 months ago
2006
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
3DIM
2003
IEEE
14 years 3 days ago
2003
IEEE
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
GLVLSI
2003
IEEE
14 years 1 months ago
2003
IEEE
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...