Results 1 
9 of
9
Local Search Strategies for Satisfiability Testing
 DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
, 1995
"... It has recently been shown that local search is surprisingly good at finding satisfying assignments for certain classes of CNF formulas [24]. In this paper we demonstrate that the power of local search for satisfiability testing can be further enhanced by employinga new strategy, called "mixed ..."
Abstract

Cited by 276 (25 self)
 Add to MetaCart
It has recently been shown that local search is surprisingly good at finding satisfying assignments for certain classes of CNF formulas [24]. In this paper we demonstrate that the power of local search for satisfiability testing can be further enhanced by employinga new strategy, called "mixed random walk", for escaping from local minima. We present experimental results showing how this strategy allows us to handle formulas that are substantially larger than those that can be solved with basic local search. We also present a detailed comparison of our random walk strategy with simulated annealing. Our results show that mixed random walk is the superior strategy on several classes of computationally difficult problem instances. Finally, we present results demonstrating the effectiveness of local search with walk for solving circuit synthesis and diagnosis problems.
A Grasp For Satisfiability
 CLIQUES, COLORING, AND SATISFIABILITY: THE SECOND DIMACS IMPLEMENTATION CHALLENGE, VOLUME 26 OF DIMACS SERIES ON DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
, 1996
"... A greedy randomized adaptive search procedure (Grasp) is a randomized heuristic that has been shown to quickly produce good quality solutions for a wide variety of combinatorial optimization problems. In this paper, we describe a Grasp for the satisfiability (SAT) problem. This algorithm can be also ..."
Abstract

Cited by 30 (6 self)
 Add to MetaCart
A greedy randomized adaptive search procedure (Grasp) is a randomized heuristic that has been shown to quickly produce good quality solutions for a wide variety of combinatorial optimization problems. In this paper, we describe a Grasp for the satisfiability (SAT) problem. This algorithm can be also directly applied to both the weighted and unweighted versions of the maximum satisfiability (MAXSAT) problem. We review basic concepts of Grasp: construction and local search algorithms. The implementation of Grasp for the SAT problem is described in detail. Computational experience on a large set of test problems is presented.
Solving Satisfiability Problems Using a Combination of Systematic and Local Search
 Rutgers University
, 1996
"... this paper we present a simple method for using a local search algorithm to derive ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
this paper we present a simple method for using a local search algorithm to derive
Solving Satisfiability Problems Using Reconfigurable Computing
 ACM Transactions on Computer Systems
, 2001
"... This paper reports on an innovative approach for solving satisfiability problems for propositional formulas in conjunctive normal form (SAT) by creating a logic circuit that is specialized to solve each problem instance on field programmable gate arrays (FPGAs). This approach has become feasible due ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
This paper reports on an innovative approach for solving satisfiability problems for propositional formulas in conjunctive normal form (SAT) by creating a logic circuit that is specialized to solve each problem instance on field programmable gate arrays (FPGAs). This approach has become feasible due to recent advances in reconfigurable computing and has opened up an exciting new research field in algorithm design. SAT is an important subclass of constraint satisfaction problems, which can formalize a wide range of application problems.
Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation
 In Proceedings of CP99
, 1999
"... . This paper presents new results on an innovative approach for solving satisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field Programmable Gate Arrays (FPGAs). This approach has become feasible due to recent advances in Recon ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
. This paper presents new results on an innovative approach for solving satisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field Programmable Gate Arrays (FPGAs). This approach has become feasible due to recent advances in Reconfigurable Computing, and has opened up an exciting new research field in algorithm design. Wehave developed an algorithm that is suitable for a logic circuit implementation. This algorithm is basically equivalent to the DavisPutnam procedure with Experimental Unit Propagation. The algorithm requires fewer hardware resources than previous approaches. Simulation results show that this method can solve a hard random 3SAT problem with 400 variables within 1.6 minutes at a clock rate of 10MHz. Faster speeds can be obtained by increasing the clock rate. Furthermore, wehave actually implemented a 128variable, 256clause problem instance on FPGAs. 1
Some ideas on random generation of kSAT instances
, 1994
"... In our previous research work, we have studied the detection and the use of symmetries to improve the efficiency of satisfiability algorithms. We have believed that the most hard SAT problems present strucural properties such as symmetries. However, recently several authors have exhibited a threshol ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In our previous research work, we have studied the detection and the use of symmetries to improve the efficiency of satisfiability algorithms. We have believed that the most hard SAT problems present strucural properties such as symmetries. However, recently several authors have exhibited a threshold phenomena on randomly generated KSAT instances. It is shown that hard instances can be generated randomly using the fixed clauselength model. The experiments we have performed on such instances show that they don't contain symmetries. This fact renews our interest in random generation of SAT instances. More precisely, we focus our research on the two following questions : ffl is it possible to use conditions based on symmetry in random generation in order to generate even harder instances ? ffl we have observed that the instances generated by the fixed clauselength model contains about 50% of horn clauses. What happens if we tend the probability of negating the variables from 0.5 to ...
Dynamic Load Balancing on Clusters of Heterogenous Workstations
, 1997
"... When using the computing resources of workstation networks by parallel programs dynamic load balancing is an important task. We describe a distributed, local migration algorithm, called precomputationbased load balancing, which treats this problem efficiently. Its performance is empirically demonst ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
When using the computing resources of workstation networks by parallel programs dynamic load balancing is an important task. We describe a distributed, local migration algorithm, called precomputationbased load balancing, which treats this problem efficiently. Its performance is empirically demonstrated solving the satisfiability problem on an heterogenous network of 12 workstations. We discuss the influence of processor weighting and parameter adaption on speedup and idle times.
Precomputation based Load Balancing
 UNIVERSITÄT ZU KÖLN
, 1996
"... An algorithm, called PLB is introduced, which redistributes workload in a processor network N in order to supply every processor of N with (about) the same amount of workload. PLB is defined in its basic form for trees, but can be extended to other topologies. The redistribution is done locally on t ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
An algorithm, called PLB is introduced, which redistributes workload in a processor network N in order to supply every processor of N with (about) the same amount of workload. PLB is defined in its basic form for trees, but can be extended to other topologies. The redistribution is done locally on the basis of information of over or underload in subnetworks of N . We show, that PLB performs O(\Delta) steps, only, where \Delta denotes the diameter of N , and in the average case at most four times as many workload has to be migrated in complete binary trees compared to clique networks, the best possible networks. We describe an implementation of PLB and present experimental results when solving the Boolean satisfiability problem, demonstrating that PLB performs very well in practice.
TOWARDS HYBRID METHODS FOR SOLVING HARD COMBINATORIAL OPTIMIZATION PROBLEMS
, 2006
"... in my opinion, it ..."