Random Subset Optimization

Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization problems benefit significantly from randomization. However, well-known algorithms such as stochastic search or simulated annealing perform a less directed random walk than used in satisfiability. By making a closer analogy to the technique used in Walksat, we obtain a different kind of randomization. We report on preliminary experiments on small problems that show that it performs significantly better on general optimization problems than other stochastic search algorithms.

• Type: Conference
• Year: 2006
• Where: ECAI
• Authors: Boi Faltings, Quang Huy Nguyen
• Keywords: Artificial Intelligence, ECAI 2006, Random Walk, Search Algorithms, Stochastic Search