Sciweavers

470 search results - page 61 / 94
» Tabu Search for SAT
Sort
View
AIPS
2003
13 years 9 months ago
Symmetry Reduction for SAT Representations of Transition Systems
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if t...
Jussi Rintanen
SAT
2004
Springer
131views Hardware» more  SAT 2004»
14 years 1 months ago
A Comparative Study of 2QBF Algorithms
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
Darsh P. Ranjan, Daijue Tang, Sharad Malik
CP
2000
Springer
14 years 1 days ago
Analysis of Random Noise and Random Walk Algorithms
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
Bhaskar Krishnamachari, Xi Xie, Bart Selman, Steph...
HAIS
2009
Springer
14 years 9 days ago
A GA(TS) Hybrid Algorithm for Scheduling in Computational Grids
The hybridization of heuristics methods aims at exploring the synergies among stand alone heuristics in order to achieve better results for the optimization problem under study. In...
Fatos Xhafa, Juan Antonio Gonzalez, Keshav P. Daha...
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
13 years 11 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius